{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:T2ZFHTEV6VULX6IOHIM3PF6AM6","short_pith_number":"pith:T2ZFHTEV","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"},"canonical_sha256":"9eb253cc95f568bbf90e3a19b797c0679a0728a8a1284ed1f70fa1f91a2c2756","source":{"kind":"arxiv","id":"1504.02429","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.02429","created_at":"2026-05-18T02:19:08Z"},{"alias_kind":"arxiv_version","alias_value":"1504.02429v1","created_at":"2026-05-18T02:19:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.02429","created_at":"2026-05-18T02:19:08Z"},{"alias_kind":"pith_short_12","alias_value":"T2ZFHTEV6VUL","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"T2ZFHTEV6VULX6IO","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"T2ZFHTEV","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:T2ZFHTEV6VULX6IOHIM3PF6AM6","target":"record","payload":{"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"},"canonical_sha256":"9eb253cc95f568bbf90e3a19b797c0679a0728a8a1284ed1f70fa1f91a2c2756","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"},"source_kind":"arxiv","source_id":"1504.02429","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:19:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wJcs2ICmEMxRvPSoH9v2LdoT6IX6odq+WnO49uZkEdbNFVG7g3Xk5G/LvUDF/2RpZtlgB0GqED7xwPLrI0dBDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T10:04:55.469583Z"},"content_sha256":"e322bac40f9e45387505decf9151c5cc52fe5052c2f01444cad83a5814eebacc","schema_version":"1.0","event_id":"sha256:e322bac40f9e45387505decf9151c5cc52fe5052c2f01444cad83a5814eebacc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:T2ZFHTEV6VULX6IOHIM3PF6AM6","target":"graph","payload":{"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"},"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:19:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2EIUbZz7RFlV4mBdVkF1orFYwRToF8xqnh6eQ2Lk5AluJki+SMJ0BXYMO3UUhV+ex2rJfu9DxOkpIlEB+LOnBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T10:04:55.469926Z"},"content_sha256":"f86ecc225e4fb19e30859dfe315af947dea25efa1b27af5164fec65d5a29c04f","schema_version":"1.0","event_id":"sha256:f86ecc225e4fb19e30859dfe315af947dea25efa1b27af5164fec65d5a29c04f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T2ZFHTEV6VULX6IOHIM3PF6AM6/bundle.json","state_url":"https://pith.science/pith/T2ZFHTEV6VULX6IOHIM3PF6AM6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T2ZFHTEV6VULX6IOHIM3PF6AM6/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-06-23T10:04:55Z","links":{"resolver":"https://pith.science/pith/T2ZFHTEV6VULX6IOHIM3PF6AM6","bundle":"https://pith.science/pith/T2ZFHTEV6VULX6IOHIM3PF6AM6/bundle.json","state":"https://pith.science/pith/T2ZFHTEV6VULX6IOHIM3PF6AM6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T2ZFHTEV6VULX6IOHIM3PF6AM6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:T2ZFHTEV6VULX6IOHIM3PF6AM6","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":"e7436e5cb60e8225b023159d79ffc7255328550253faa9c78c675505efc5b102","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-04-09T19:17:42Z","title_canon_sha256":"ae7ea3208bd9ee46543fdf95b46a26abce3729cc8ad522450f71d8f195f8b863"},"schema_version":"1.0","source":{"id":"1504.02429","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.02429","created_at":"2026-05-18T02:19:08Z"},{"alias_kind":"arxiv_version","alias_value":"1504.02429v1","created_at":"2026-05-18T02:19:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.02429","created_at":"2026-05-18T02:19:08Z"},{"alias_kind":"pith_short_12","alias_value":"T2ZFHTEV6VUL","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"T2ZFHTEV6VULX6IO","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"T2ZFHTEV","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:f86ecc225e4fb19e30859dfe315af947dea25efa1b27af5164fec65d5a29c04f","target":"graph","created_at":"2026-05-18T02:19:08Z","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":"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","authors_text":"Anna Ben-Hamou, Justin Salez","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-04-09T19:17:42Z","title":"Cutoff for non-backtracking random walks on sparse random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.02429","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:e322bac40f9e45387505decf9151c5cc52fe5052c2f01444cad83a5814eebacc","target":"record","created_at":"2026-05-18T02:19:08Z","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":"e7436e5cb60e8225b023159d79ffc7255328550253faa9c78c675505efc5b102","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-04-09T19:17:42Z","title_canon_sha256":"ae7ea3208bd9ee46543fdf95b46a26abce3729cc8ad522450f71d8f195f8b863"},"schema_version":"1.0","source":{"id":"1504.02429","kind":"arxiv","version":1}},"canonical_sha256":"9eb253cc95f568bbf90e3a19b797c0679a0728a8a1284ed1f70fa1f91a2c2756","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9eb253cc95f568bbf90e3a19b797c0679a0728a8a1284ed1f70fa1f91a2c2756","first_computed_at":"2026-05-18T02:19:08.929308Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:19:08.929308Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RSt6vybJikW23RBra3o449FfkG0QH9tu2yekLSJtDOSg42GggFjPlM7qScrnmLfzj97aPUZ3xXBP+CUwHnL3BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:19:08.929981Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.02429","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e322bac40f9e45387505decf9151c5cc52fe5052c2f01444cad83a5814eebacc","sha256:f86ecc225e4fb19e30859dfe315af947dea25efa1b27af5164fec65d5a29c04f"],"state_sha256":"5d50faa27f37d9cb850952c617e1a95ec2f776f0baab0403bab6a7f9d1959d55"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wqeGtMC46WWxX2daOxLBrzKWJdIYf2VpVaMSWgw0D/VxDatE8G6/BbWbCbmoa47ayB8sNDo1EVUEiKShzbsNCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T10:04:55.471844Z","bundle_sha256":"28bf733696b46d9be21a5a5432d58fa3b43f9cc4f532d8c00b18c1b2fd283408"}}