Assertion list
node (primary) → HasA
Results from Ascent++: 120
node → HasA → datum 0.73
node → HasA → value 0.65
node → HasA → zero 0.65
node → HasA → parent 0.64
node → HasA → pointer 0.62
node → HasA → reference 0.62
node → HasA → a copy of the blockchain 0.61
node → HasA → label 0.60
node → HasA → child 0.60
node → HasA → two children 0.59
node → HasA → type 0.58
node → HasA → input 0.58
node → HasA → child nodes 0.57
node → HasA → degree 0.57
node → HasA → unique identifier 0.56
node → HasA → path 0.55
node → HasA → same data 0.55
node → HasA → output 0.55
node → HasA → multiple parents 0.54
node → HasA → direct connection 0.53
node → HasA → message 0.53
node → HasA → packet 0.53
node → HasA → property 0.53
node → HasA → the capability 0.53
node → HasA → connection 0.53
node → HasA → memory 0.53
node → HasA → an ip address 0.53
node → HasA → arc 0.53
node → HasA → content 0.53
node → HasA → storage 0.53
node → HasA → same value 0.52
node → HasA → unique address 0.52
node → HasA → connectivity 0.50
node → HasA → incentive 0.50
node → HasA → same probability 0.50
node → HasA → same state 0.50
node → HasA → a list of other nodes 0.49
node → HasA → private key 0.49
node → HasA → same parent 0.49
node → HasA → at least one egress interface 0.46
node → HasA → note 0.46
node → HasA → attribute 0.45
node → HasA → many connections 0.44
node → HasA → exactly one parent 0.44
node → HasA → a children object 0.41
node → HasA → a cost of infinity 0.41
node → HasA → all the information 0.41
node → HasA → clock 0.41
node → HasA → different values 0.41
node → HasA → enough memory 0.41
node → HasA → equal hardware capability 0.41
node → HasA → exactly two children 0.41
node → HasA → quorum 0.41
node → HasA → same color 0.41
node → HasA → same rights 0.41
node → HasA → table 0.41
node → HasA → the status 0.41
node → HasA → two paths 0.41
node → HasA → two sockets 0.41
node → HasA → address 0.40
node → HasA → more than two children 0.40
node → HasA → receiver 0.40
node → HasA → a number of peers 0.38
node → HasA → same number of links 0.38
node → HasA → right child 0.38
node → HasA → many children 0.36
node → HasA → internal structure 0.35
node → HasA → weight 0.35
node → HasA → limit 0.34
node → HasA → relationship 0.34
node → HasA → equal opportunity 0.32
node → HasA → left child 0.32
node → HasA → unique identity 0.32
node → HasA → many links 0.31
node → HasA → higher priority 0.31
node → HasA → higher probability 0.31
node → HasA → limited resources 0.31
node → HasA → sufficient resources 0.31
node → HasA → two pointers 0.31
node → HasA → a power source 0.29
node → HasA → coordinate 0.29
node → HasA → downlink 0.29
node → HasA → function 0.29
node → HasA → transmitter 0.29
node → HasA → two links 0.29
node → HasA → 2 fibers 0.27
node → HasA → a data field 0.27
node → HasA → a rf transceiver 0.27
node → HasA → an aggregator log 0.27
node → HasA → associated profile 0.27
node → HasA → high degree 0.27
node → HasA → menu 0.27
node → HasA → other properties 0.27
node → HasA → queue 0.27
node → HasA → 6 connections 0.25
node → HasA → a 3d transform 0.25
node → HasA → a master key 0.25
node → HasA → a message handler 0.25
node → HasA → all the content 0.25
node → HasA → annotation 0.25
node → HasA → coefficient 0.25
node → HasA → corresponding records 0.25
node → HasA → file 0.25
node → HasA → height 0.25
node → HasA → installed daemon 0.25
node → HasA → mime type 0.25
node → HasA → more energy 0.25
node → HasA → one vote 0.25
node → HasA → possession of the token 0.25
node → HasA → predefined criteria 0.25
node → HasA → same num_tokens value 0.25
node → HasA → the highest betweenness central… 0.25
node → HasA → the largest available memory 0.25
node → HasA → the largest degree 0.25
node → HasA → the least traffic 0.25
node → HasA → url 0.25
node → HasA → vector 0.25
node → HasA → well-defined purpose 0.25
node → HasA → 3 consecutive errors 0.16
node → HasA → expanded-name 0.16