{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:T2ZFHTEV6VULX6IOHIM3PF6AM6","short_pith_number":"pith:T2ZFHTEV","schema_version":"1.0","canonical_sha256":"9eb253cc95f568bbf90e3a19b797c0679a0728a8a1284ed1f70fa1f91a2c2756","source":{"kind":"arxiv","id":"1504.02429","version":1},"attestation_state":"computed","paper":{"title":"Cutoff for non-backtracking random walks on sparse random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Anna Ben-Hamou, Justin Salez","submitted_at":"2015-04-09T19:17:42Z","abstract_excerpt":"A finite ergodic Markov chain is said to exhibit cutoff if its distance to stationarity remains close to 1 over a certain number of iterations and then abruptly drops to near 0 on a much shorter time scale. Discovered in the context of card shuffling (Aldous-Diaconis, 1986), this phenomenon is now believed to be rather typical among fast mixing Markov chains. Yet, establishing it rigorously often requires a challengingly detailed understanding of the underlying chain. Here we consider non-backtracking random walks on random graphs with a given degree sequence. Under a general sparsity conditio"},"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":"1504.02429","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-04-09T19:17:42Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"ae7ea3208bd9ee46543fdf95b46a26abce3729cc8ad522450f71d8f195f8b863","abstract_canon_sha256":"e7436e5cb60e8225b023159d79ffc7255328550253faa9c78c675505efc5b102"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:08.929981Z","signature_b64":"RSt6vybJikW23RBra3o449FfkG0QH9tu2yekLSJtDOSg42GggFjPlM7qScrnmLfzj97aPUZ3xXBP+CUwHnL3BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9eb253cc95f568bbf90e3a19b797c0679a0728a8a1284ed1f70fa1f91a2c2756","last_reissued_at":"2026-05-18T02:19:08.929308Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:08.929308Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cutoff for non-backtracking random walks on sparse random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Anna Ben-Hamou, Justin Salez","submitted_at":"2015-04-09T19:17:42Z","abstract_excerpt":"A finite ergodic Markov chain is said to exhibit cutoff if its distance to stationarity remains close to 1 over a certain number of iterations and then abruptly drops to near 0 on a much shorter time scale. Discovered in the context of card shuffling (Aldous-Diaconis, 1986), this phenomenon is now believed to be rather typical among fast mixing Markov chains. Yet, establishing it rigorously often requires a challengingly detailed understanding of the underlying chain. Here we consider non-backtracking random walks on random graphs with a given degree sequence. Under a general sparsity conditio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.02429","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":"1504.02429","created_at":"2026-05-18T02:19:08.929417+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.02429v1","created_at":"2026-05-18T02:19:08.929417+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.02429","created_at":"2026-05-18T02:19:08.929417+00:00"},{"alias_kind":"pith_short_12","alias_value":"T2ZFHTEV6VUL","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"T2ZFHTEV6VULX6IO","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"T2ZFHTEV","created_at":"2026-05-18T12:29:42.218222+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/T2ZFHTEV6VULX6IOHIM3PF6AM6","json":"https://pith.science/pith/T2ZFHTEV6VULX6IOHIM3PF6AM6.json","graph_json":"https://pith.science/api/pith-number/T2ZFHTEV6VULX6IOHIM3PF6AM6/graph.json","events_json":"https://pith.science/api/pith-number/T2ZFHTEV6VULX6IOHIM3PF6AM6/events.json","paper":"https://pith.science/paper/T2ZFHTEV"},"agent_actions":{"view_html":"https://pith.science/pith/T2ZFHTEV6VULX6IOHIM3PF6AM6","download_json":"https://pith.science/pith/T2ZFHTEV6VULX6IOHIM3PF6AM6.json","view_paper":"https://pith.science/paper/T2ZFHTEV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.02429&json=true","fetch_graph":"https://pith.science/api/pith-number/T2ZFHTEV6VULX6IOHIM3PF6AM6/graph.json","fetch_events":"https://pith.science/api/pith-number/T2ZFHTEV6VULX6IOHIM3PF6AM6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T2ZFHTEV6VULX6IOHIM3PF6AM6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T2ZFHTEV6VULX6IOHIM3PF6AM6/action/storage_attestation","attest_author":"https://pith.science/pith/T2ZFHTEV6VULX6IOHIM3PF6AM6/action/author_attestation","sign_citation":"https://pith.science/pith/T2ZFHTEV6VULX6IOHIM3PF6AM6/action/citation_signature","submit_replication":"https://pith.science/pith/T2ZFHTEV6VULX6IOHIM3PF6AM6/action/replication_record"}},"created_at":"2026-05-18T02:19:08.929417+00:00","updated_at":"2026-05-18T02:19:08.929417+00:00"}