{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:2SX4XGPTPZJW2XLO3ZFG5W2SR5","short_pith_number":"pith:2SX4XGPT","schema_version":"1.0","canonical_sha256":"d4afcb99f37e536d5d6ede4a6edb528f4612cb872b5d78792b965e1e2a2b3720","source":{"kind":"arxiv","id":"1111.1500","version":1},"attestation_state":"computed","paper":{"title":"Mean first-passage time for random walks on undirected networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.class-ph"],"primary_cat":"cond-mat.stat-mech","authors_text":"Alafate Julaiti, Baoyu Hou, Guanrong Chen, Hongjuan Zhang, Zhongzhi Zhang","submitted_at":"2011-11-07T07:46:37Z","abstract_excerpt":"In this paper, by using two different techniques we derive an explicit formula for the mean first-passage time (MFPT) between any pair of nodes on a general undirected network, which is expressed in terms of eigenvalues and eigenvectors of an associated matrix similar to the transition matrix. We then apply the formula to derive a lower bound for the MFPT to arrive at a given node with the starting point chosen from the stationary distribution over the set of nodes. We show that for a correlated scale-free network of size $N$ with a degree distribution $P(d)\\sim d^{-\\gamma}$, the scaling of th"},"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":"1111.1500","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2011-11-07T07:46:37Z","cross_cats_sorted":["physics.class-ph"],"title_canon_sha256":"befea50b70b0bed75698169a9590504ae7251f3c55a3e63da1908115e3543460","abstract_canon_sha256":"751cd5f72253e5d8fde1e6f709327da7faff1d214e72cdd6a6ca5e2f4fe737ba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:26.845820Z","signature_b64":"VZ6EEVhJEe8qKAzvY7wnrMGi9Kg4XBYmWrjYZ2jeeNj+RjkezGGRa9SREkY92qm83ujjxiXXatjrS9eAkmYxDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4afcb99f37e536d5d6ede4a6edb528f4612cb872b5d78792b965e1e2a2b3720","last_reissued_at":"2026-05-18T04:05:26.845205Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:26.845205Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mean first-passage time for random walks on undirected networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.class-ph"],"primary_cat":"cond-mat.stat-mech","authors_text":"Alafate Julaiti, Baoyu Hou, Guanrong Chen, Hongjuan Zhang, Zhongzhi Zhang","submitted_at":"2011-11-07T07:46:37Z","abstract_excerpt":"In this paper, by using two different techniques we derive an explicit formula for the mean first-passage time (MFPT) between any pair of nodes on a general undirected network, which is expressed in terms of eigenvalues and eigenvectors of an associated matrix similar to the transition matrix. We then apply the formula to derive a lower bound for the MFPT to arrive at a given node with the starting point chosen from the stationary distribution over the set of nodes. We show that for a correlated scale-free network of size $N$ with a degree distribution $P(d)\\sim d^{-\\gamma}$, the scaling of th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.1500","kind":"arxiv","version":1},"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":"1111.1500","created_at":"2026-05-18T04:05:26.845282+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.1500v1","created_at":"2026-05-18T04:05:26.845282+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.1500","created_at":"2026-05-18T04:05:26.845282+00:00"},{"alias_kind":"pith_short_12","alias_value":"2SX4XGPTPZJW","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"2SX4XGPTPZJW2XLO","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"2SX4XGPT","created_at":"2026-05-18T12:26:18.847500+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/2SX4XGPTPZJW2XLO3ZFG5W2SR5","json":"https://pith.science/pith/2SX4XGPTPZJW2XLO3ZFG5W2SR5.json","graph_json":"https://pith.science/api/pith-number/2SX4XGPTPZJW2XLO3ZFG5W2SR5/graph.json","events_json":"https://pith.science/api/pith-number/2SX4XGPTPZJW2XLO3ZFG5W2SR5/events.json","paper":"https://pith.science/paper/2SX4XGPT"},"agent_actions":{"view_html":"https://pith.science/pith/2SX4XGPTPZJW2XLO3ZFG5W2SR5","download_json":"https://pith.science/pith/2SX4XGPTPZJW2XLO3ZFG5W2SR5.json","view_paper":"https://pith.science/paper/2SX4XGPT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.1500&json=true","fetch_graph":"https://pith.science/api/pith-number/2SX4XGPTPZJW2XLO3ZFG5W2SR5/graph.json","fetch_events":"https://pith.science/api/pith-number/2SX4XGPTPZJW2XLO3ZFG5W2SR5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2SX4XGPTPZJW2XLO3ZFG5W2SR5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2SX4XGPTPZJW2XLO3ZFG5W2SR5/action/storage_attestation","attest_author":"https://pith.science/pith/2SX4XGPTPZJW2XLO3ZFG5W2SR5/action/author_attestation","sign_citation":"https://pith.science/pith/2SX4XGPTPZJW2XLO3ZFG5W2SR5/action/citation_signature","submit_replication":"https://pith.science/pith/2SX4XGPTPZJW2XLO3ZFG5W2SR5/action/replication_record"}},"created_at":"2026-05-18T04:05:26.845282+00:00","updated_at":"2026-05-18T04:05:26.845282+00:00"}