{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:J4L6A42CL5YD5VELK4QO2QA64W","short_pith_number":"pith:J4L6A42C","schema_version":"1.0","canonical_sha256":"4f17e073425f703ed48b5720ed401ee5aba7923927d0d57b1ff2c4a5fed3a6e9","source":{"kind":"arxiv","id":"1101.5379","version":3},"attestation_state":"computed","paper":{"title":"How Many Nodes are Effectively Accessed in Complex Networks?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"Jo\\~ao L. B. Batista, Luciano da F. Costa, Matheus P. Viana","submitted_at":"2011-01-27T20:18:39Z","abstract_excerpt":"The measurement called accessibility has been proposed as a means to quantify the efficiency of the communication between nodes in complex networks. This article reports important results regarding the properties of the accessibility, including its relationship with the average minimal time to visit all nodes reachable after $h$ steps along a random walk starting from a source, as well as the number of nodes that are visited after a finite period of time. We characterize the relationship between accessibility and the average number of walks required in order to visit all reachable nodes (the e"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1101.5379","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2011-01-27T20:18:39Z","cross_cats_sorted":["cond-mat.stat-mech","cs.SI"],"title_canon_sha256":"58963120710b45f61ca625aa6fa55c8bae142ceacace4273d7fa2111dc43ecb3","abstract_canon_sha256":"f3d3929c55f5096717b2e83b53ce3102d0dbd0409abd4d057682338a7e3bc1f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:23:03.395299Z","signature_b64":"1Yqx+/wsR50b0yOFQKEjLSX34ZhB6Rg8S5GOHLj1sdTUuS+anpdKtrdcXtyHndxnUdyp6fSzt6LVNeMP1t0oBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f17e073425f703ed48b5720ed401ee5aba7923927d0d57b1ff2c4a5fed3a6e9","last_reissued_at":"2026-05-18T03:23:03.394669Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:23:03.394669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How Many Nodes are Effectively Accessed in Complex Networks?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"Jo\\~ao L. B. Batista, Luciano da F. Costa, Matheus P. Viana","submitted_at":"2011-01-27T20:18:39Z","abstract_excerpt":"The measurement called accessibility has been proposed as a means to quantify the efficiency of the communication between nodes in complex networks. This article reports important results regarding the properties of the accessibility, including its relationship with the average minimal time to visit all nodes reachable after $h$ steps along a random walk starting from a source, as well as the number of nodes that are visited after a finite period of time. We characterize the relationship between accessibility and the average number of walks required in order to visit all reachable nodes (the e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.5379","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1101.5379","created_at":"2026-05-18T03:23:03.394784+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.5379v3","created_at":"2026-05-18T03:23:03.394784+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.5379","created_at":"2026-05-18T03:23:03.394784+00:00"},{"alias_kind":"pith_short_12","alias_value":"J4L6A42CL5YD","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"J4L6A42CL5YD5VEL","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"J4L6A42C","created_at":"2026-05-18T12:26:32.869790+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/J4L6A42CL5YD5VELK4QO2QA64W","json":"https://pith.science/pith/J4L6A42CL5YD5VELK4QO2QA64W.json","graph_json":"https://pith.science/api/pith-number/J4L6A42CL5YD5VELK4QO2QA64W/graph.json","events_json":"https://pith.science/api/pith-number/J4L6A42CL5YD5VELK4QO2QA64W/events.json","paper":"https://pith.science/paper/J4L6A42C"},"agent_actions":{"view_html":"https://pith.science/pith/J4L6A42CL5YD5VELK4QO2QA64W","download_json":"https://pith.science/pith/J4L6A42CL5YD5VELK4QO2QA64W.json","view_paper":"https://pith.science/paper/J4L6A42C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.5379&json=true","fetch_graph":"https://pith.science/api/pith-number/J4L6A42CL5YD5VELK4QO2QA64W/graph.json","fetch_events":"https://pith.science/api/pith-number/J4L6A42CL5YD5VELK4QO2QA64W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J4L6A42CL5YD5VELK4QO2QA64W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J4L6A42CL5YD5VELK4QO2QA64W/action/storage_attestation","attest_author":"https://pith.science/pith/J4L6A42CL5YD5VELK4QO2QA64W/action/author_attestation","sign_citation":"https://pith.science/pith/J4L6A42CL5YD5VELK4QO2QA64W/action/citation_signature","submit_replication":"https://pith.science/pith/J4L6A42CL5YD5VELK4QO2QA64W/action/replication_record"}},"created_at":"2026-05-18T03:23:03.394784+00:00","updated_at":"2026-05-18T03:23:03.394784+00:00"}