{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:NFZ4G5IUZC2XGAMIJBP44PLAWO","short_pith_number":"pith:NFZ4G5IU","schema_version":"1.0","canonical_sha256":"6973c37514c8b5730188485fce3d60b3b53089b1e953c340e6c6966ad6fc2482","source":{"kind":"arxiv","id":"0909.0657","version":1},"attestation_state":"computed","paper":{"title":"Global mean first-passage times of random walks on complex networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cond-mat.stat-mech","authors_text":"O. B\\'enichou, R. Voituriez, V. Tejedor","submitted_at":"2009-09-03T14:16:53Z","abstract_excerpt":"We present a general framework, applicable to a broad class of random walks on complex networks, which provides a rigorous lower bound for the mean first-passage time of a random walker to a target site averaged over its starting position, the so-called global mean first-passage time (GMFPT). This bound is simply expressed in terms of the equilibrium distribution at the target, and implies a minimal scaling of the GMFPT with the network size. We show that this minimal scaling, which can be arbitrarily slow for a proper choice of highly connected target, is realized under the simple condition t"},"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":"0909.0657","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2009-09-03T14:16:53Z","cross_cats_sorted":[],"title_canon_sha256":"f9f52d8fc008e75fc2aec3834dc3132e65fff26ca7e9a16fe02ea704b06bcfa9","abstract_canon_sha256":"f4a9fbe565e1e8666d5043ffbb158613ec960a749e22e928316237c548924956"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:12:00.297533Z","signature_b64":"V71iB4d4NqrAnu8fhpbuBwyUAphrm1cmsEAOWgFRVzw0NAbLXIRgj1tPAVYxUkisdN5RArQWxtsIG+1TBzmhAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6973c37514c8b5730188485fce3d60b3b53089b1e953c340e6c6966ad6fc2482","last_reissued_at":"2026-05-18T02:12:00.296691Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:12:00.296691Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Global mean first-passage times of random walks on complex networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cond-mat.stat-mech","authors_text":"O. B\\'enichou, R. Voituriez, V. Tejedor","submitted_at":"2009-09-03T14:16:53Z","abstract_excerpt":"We present a general framework, applicable to a broad class of random walks on complex networks, which provides a rigorous lower bound for the mean first-passage time of a random walker to a target site averaged over its starting position, the so-called global mean first-passage time (GMFPT). This bound is simply expressed in terms of the equilibrium distribution at the target, and implies a minimal scaling of the GMFPT with the network size. We show that this minimal scaling, which can be arbitrarily slow for a proper choice of highly connected target, is realized under the simple condition t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0909.0657","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":"0909.0657","created_at":"2026-05-18T02:12:00.296824+00:00"},{"alias_kind":"arxiv_version","alias_value":"0909.0657v1","created_at":"2026-05-18T02:12:00.296824+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0909.0657","created_at":"2026-05-18T02:12:00.296824+00:00"},{"alias_kind":"pith_short_12","alias_value":"NFZ4G5IUZC2X","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_16","alias_value":"NFZ4G5IUZC2XGAMI","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_8","alias_value":"NFZ4G5IU","created_at":"2026-05-18T12:26:00.592388+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/NFZ4G5IUZC2XGAMIJBP44PLAWO","json":"https://pith.science/pith/NFZ4G5IUZC2XGAMIJBP44PLAWO.json","graph_json":"https://pith.science/api/pith-number/NFZ4G5IUZC2XGAMIJBP44PLAWO/graph.json","events_json":"https://pith.science/api/pith-number/NFZ4G5IUZC2XGAMIJBP44PLAWO/events.json","paper":"https://pith.science/paper/NFZ4G5IU"},"agent_actions":{"view_html":"https://pith.science/pith/NFZ4G5IUZC2XGAMIJBP44PLAWO","download_json":"https://pith.science/pith/NFZ4G5IUZC2XGAMIJBP44PLAWO.json","view_paper":"https://pith.science/paper/NFZ4G5IU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0909.0657&json=true","fetch_graph":"https://pith.science/api/pith-number/NFZ4G5IUZC2XGAMIJBP44PLAWO/graph.json","fetch_events":"https://pith.science/api/pith-number/NFZ4G5IUZC2XGAMIJBP44PLAWO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NFZ4G5IUZC2XGAMIJBP44PLAWO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NFZ4G5IUZC2XGAMIJBP44PLAWO/action/storage_attestation","attest_author":"https://pith.science/pith/NFZ4G5IUZC2XGAMIJBP44PLAWO/action/author_attestation","sign_citation":"https://pith.science/pith/NFZ4G5IUZC2XGAMIJBP44PLAWO/action/citation_signature","submit_replication":"https://pith.science/pith/NFZ4G5IUZC2XGAMIJBP44PLAWO/action/replication_record"}},"created_at":"2026-05-18T02:12:00.296824+00:00","updated_at":"2026-05-18T02:12:00.296824+00:00"}