{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:NFZ4G5IUZC2XGAMIJBP44PLAWO","short_pith_number":"pith:NFZ4G5IU","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"},"canonical_sha256":"6973c37514c8b5730188485fce3d60b3b53089b1e953c340e6c6966ad6fc2482","source":{"kind":"arxiv","id":"0909.0657","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0909.0657","created_at":"2026-05-18T02:12:00Z"},{"alias_kind":"arxiv_version","alias_value":"0909.0657v1","created_at":"2026-05-18T02:12:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0909.0657","created_at":"2026-05-18T02:12:00Z"},{"alias_kind":"pith_short_12","alias_value":"NFZ4G5IUZC2X","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"NFZ4G5IUZC2XGAMI","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"NFZ4G5IU","created_at":"2026-05-18T12:26:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:NFZ4G5IUZC2XGAMIJBP44PLAWO","target":"record","payload":{"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"},"canonical_sha256":"6973c37514c8b5730188485fce3d60b3b53089b1e953c340e6c6966ad6fc2482","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"},"source_kind":"arxiv","source_id":"0909.0657","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:12:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tYRCuKoqPtmI10Bd1pdGN1HF4Rd9f9b5RYLrgQjdNAq7L2/2J1O9gEzennqIhlb2SGwHN5iWbN9KzCrgoYKIAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T18:36:25.074777Z"},"content_sha256":"460d6c6ac1a594fa6be1fcfded97ca6fff09de51cf1c4190243b58239d2885d1","schema_version":"1.0","event_id":"sha256:460d6c6ac1a594fa6be1fcfded97ca6fff09de51cf1c4190243b58239d2885d1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:NFZ4G5IUZC2XGAMIJBP44PLAWO","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:12:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+vB/NzWSkdNgYg2e6o65njNBOABuHOEpW2+ctuJq/2tJzwEtsHDP3XV9iAOoYkXt20ZNYJRWAxHA5vJYoxuXBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T18:36:25.075156Z"},"content_sha256":"930b315b154bc5ed513b1d930836419d636764ab1861ff1f3e8e6496b5c9ab23","schema_version":"1.0","event_id":"sha256:930b315b154bc5ed513b1d930836419d636764ab1861ff1f3e8e6496b5c9ab23"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NFZ4G5IUZC2XGAMIJBP44PLAWO/bundle.json","state_url":"https://pith.science/pith/NFZ4G5IUZC2XGAMIJBP44PLAWO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NFZ4G5IUZC2XGAMIJBP44PLAWO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-18T18:36:25Z","links":{"resolver":"https://pith.science/pith/NFZ4G5IUZC2XGAMIJBP44PLAWO","bundle":"https://pith.science/pith/NFZ4G5IUZC2XGAMIJBP44PLAWO/bundle.json","state":"https://pith.science/pith/NFZ4G5IUZC2XGAMIJBP44PLAWO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NFZ4G5IUZC2XGAMIJBP44PLAWO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:NFZ4G5IUZC2XGAMIJBP44PLAWO","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f4a9fbe565e1e8666d5043ffbb158613ec960a749e22e928316237c548924956","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2009-09-03T14:16:53Z","title_canon_sha256":"f9f52d8fc008e75fc2aec3834dc3132e65fff26ca7e9a16fe02ea704b06bcfa9"},"schema_version":"1.0","source":{"id":"0909.0657","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0909.0657","created_at":"2026-05-18T02:12:00Z"},{"alias_kind":"arxiv_version","alias_value":"0909.0657v1","created_at":"2026-05-18T02:12:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0909.0657","created_at":"2026-05-18T02:12:00Z"},{"alias_kind":"pith_short_12","alias_value":"NFZ4G5IUZC2X","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"NFZ4G5IUZC2XGAMI","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"NFZ4G5IU","created_at":"2026-05-18T12:26:00Z"}],"graph_snapshots":[{"event_id":"sha256:930b315b154bc5ed513b1d930836419d636764ab1861ff1f3e8e6496b5c9ab23","target":"graph","created_at":"2026-05-18T02:12:00Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"O. B\\'enichou, R. Voituriez, V. Tejedor","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2009-09-03T14:16:53Z","title":"Global mean first-passage times of random walks on complex networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0909.0657","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:460d6c6ac1a594fa6be1fcfded97ca6fff09de51cf1c4190243b58239d2885d1","target":"record","created_at":"2026-05-18T02:12:00Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f4a9fbe565e1e8666d5043ffbb158613ec960a749e22e928316237c548924956","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2009-09-03T14:16:53Z","title_canon_sha256":"f9f52d8fc008e75fc2aec3834dc3132e65fff26ca7e9a16fe02ea704b06bcfa9"},"schema_version":"1.0","source":{"id":"0909.0657","kind":"arxiv","version":1}},"canonical_sha256":"6973c37514c8b5730188485fce3d60b3b53089b1e953c340e6c6966ad6fc2482","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6973c37514c8b5730188485fce3d60b3b53089b1e953c340e6c6966ad6fc2482","first_computed_at":"2026-05-18T02:12:00.296691Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:12:00.296691Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V71iB4d4NqrAnu8fhpbuBwyUAphrm1cmsEAOWgFRVzw0NAbLXIRgj1tPAVYxUkisdN5RArQWxtsIG+1TBzmhAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:12:00.297533Z","signed_message":"canonical_sha256_bytes"},"source_id":"0909.0657","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:460d6c6ac1a594fa6be1fcfded97ca6fff09de51cf1c4190243b58239d2885d1","sha256:930b315b154bc5ed513b1d930836419d636764ab1861ff1f3e8e6496b5c9ab23"],"state_sha256":"f40cc8d9855826d4a58c44ba79238248185569fc4ef2a67c9a460284e5d45cec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tLiegQ9emm5VqdBPJG1zSVlQdv+A0zj0AUPvY5vIgsYOJJseCBkCkZ1CC33SV47N8UsWBc+FYBWgFp1Qlg96AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-18T18:36:25.076513Z","bundle_sha256":"3a93da2c809b3779ddb9700f912285be48eb12b7600c0d20dae9b240a9fe964a"}}