{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:QYEJNUDDZJJKLQSCRJCCDPLN2K","short_pith_number":"pith:QYEJNUDD","canonical_record":{"source":{"id":"1707.04784","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-07-15T20:16:07Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"da46ffff0c992e4eecfd03e087f074fa7b4a78847366dfd6b9f6bd364b561b8a","abstract_canon_sha256":"15ad326ec501d562a84a3831df892003958399a866e44341a1f29d67c1e1ae62"},"schema_version":"1.0"},"canonical_sha256":"860896d063ca52a5c2428a4421bd6dd28c71ef816c6b52bb95f46059348bf3d5","source":{"kind":"arxiv","id":"1707.04784","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04784","created_at":"2026-05-18T00:16:50Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04784v2","created_at":"2026-05-18T00:16:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04784","created_at":"2026-05-18T00:16:50Z"},{"alias_kind":"pith_short_12","alias_value":"QYEJNUDDZJJK","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QYEJNUDDZJJKLQSC","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QYEJNUDD","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:QYEJNUDDZJJKLQSCRJCCDPLN2K","target":"record","payload":{"canonical_record":{"source":{"id":"1707.04784","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-07-15T20:16:07Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"da46ffff0c992e4eecfd03e087f074fa7b4a78847366dfd6b9f6bd364b561b8a","abstract_canon_sha256":"15ad326ec501d562a84a3831df892003958399a866e44341a1f29d67c1e1ae62"},"schema_version":"1.0"},"canonical_sha256":"860896d063ca52a5c2428a4421bd6dd28c71ef816c6b52bb95f46059348bf3d5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:50.662900Z","signature_b64":"FiEM/kzEP7JREPIje6wdsjg8RBLiW/tckfdd2UHI9pbFRiHD97L8LxjOHInyUXiDwwONC5NTal1w+7bS0QLIAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"860896d063ca52a5c2428a4421bd6dd28c71ef816c6b52bb95f46059348bf3d5","last_reissued_at":"2026-05-18T00:16:50.661041Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:50.661041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.04784","source_version":2,"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-18T00:16:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YE6IMwr7lSvBkiAZ3cW9uwC6/2OEKIQTWKZ6S3EvIzq0Rc+LQXiQ8DCbOKFua45LogfGpblk+wC41oxDNQ6hBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T05:03:20.352083Z"},"content_sha256":"b4e26ae36c0bb840a844ea83bf2ec3065b5d3165363715c3d0f3ef0a1e5e46fa","schema_version":"1.0","event_id":"sha256:b4e26ae36c0bb840a844ea83bf2ec3065b5d3165363715c3d0f3ef0a1e5e46fa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:QYEJNUDDZJJKLQSCRJCCDPLN2K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Comparing mixing times 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, Eyal Lubetzky, Yuval Peres","submitted_at":"2017-07-15T20:16:07Z","abstract_excerpt":"It is natural to expect that nonbacktracking random walk will mix faster than simple random walks, but so far this has only been proved in regular graphs. To analyze typical irregular graphs, let $G$ be a random graph on $n$ vertices with minimum degree 3 and a degree distribution that has exponential tails. We determine the precise worst-case mixing time for simple random walk on $G$, and show that, with high probability, it exhibits cutoff at time $\\mathbf{h}^{-1} \\log n$, where $\\mathbf{h}$ is the asymptotic entropy for simple random walk on a Galton--Watson tree that approximates $G$ local"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04784","kind":"arxiv","version":2},"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-18T00:16:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rKRLHAw23um7AkfjsngZCkDeJaAhWcqowOpmGHBVYZiuqICvbcvJYd3dmTrh/tFobwQ3KKjs0+V1pezKkaghBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T05:03:20.352427Z"},"content_sha256":"0679b8c8666c08f7e6ca5de4f045f4415b3065f5c9ed7bd0d1f577d42348817b","schema_version":"1.0","event_id":"sha256:0679b8c8666c08f7e6ca5de4f045f4415b3065f5c9ed7bd0d1f577d42348817b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QYEJNUDDZJJKLQSCRJCCDPLN2K/bundle.json","state_url":"https://pith.science/pith/QYEJNUDDZJJKLQSCRJCCDPLN2K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QYEJNUDDZJJKLQSCRJCCDPLN2K/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-07-02T05:03:20Z","links":{"resolver":"https://pith.science/pith/QYEJNUDDZJJKLQSCRJCCDPLN2K","bundle":"https://pith.science/pith/QYEJNUDDZJJKLQSCRJCCDPLN2K/bundle.json","state":"https://pith.science/pith/QYEJNUDDZJJKLQSCRJCCDPLN2K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QYEJNUDDZJJKLQSCRJCCDPLN2K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QYEJNUDDZJJKLQSCRJCCDPLN2K","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":"15ad326ec501d562a84a3831df892003958399a866e44341a1f29d67c1e1ae62","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-07-15T20:16:07Z","title_canon_sha256":"da46ffff0c992e4eecfd03e087f074fa7b4a78847366dfd6b9f6bd364b561b8a"},"schema_version":"1.0","source":{"id":"1707.04784","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04784","created_at":"2026-05-18T00:16:50Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04784v2","created_at":"2026-05-18T00:16:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04784","created_at":"2026-05-18T00:16:50Z"},{"alias_kind":"pith_short_12","alias_value":"QYEJNUDDZJJK","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QYEJNUDDZJJKLQSC","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QYEJNUDD","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:0679b8c8666c08f7e6ca5de4f045f4415b3065f5c9ed7bd0d1f577d42348817b","target":"graph","created_at":"2026-05-18T00:16:50Z","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":"It is natural to expect that nonbacktracking random walk will mix faster than simple random walks, but so far this has only been proved in regular graphs. To analyze typical irregular graphs, let $G$ be a random graph on $n$ vertices with minimum degree 3 and a degree distribution that has exponential tails. We determine the precise worst-case mixing time for simple random walk on $G$, and show that, with high probability, it exhibits cutoff at time $\\mathbf{h}^{-1} \\log n$, where $\\mathbf{h}$ is the asymptotic entropy for simple random walk on a Galton--Watson tree that approximates $G$ local","authors_text":"Anna Ben-Hamou, Eyal Lubetzky, Yuval Peres","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-07-15T20:16:07Z","title":"Comparing mixing times on sparse random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04784","kind":"arxiv","version":2},"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:b4e26ae36c0bb840a844ea83bf2ec3065b5d3165363715c3d0f3ef0a1e5e46fa","target":"record","created_at":"2026-05-18T00:16:50Z","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":"15ad326ec501d562a84a3831df892003958399a866e44341a1f29d67c1e1ae62","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-07-15T20:16:07Z","title_canon_sha256":"da46ffff0c992e4eecfd03e087f074fa7b4a78847366dfd6b9f6bd364b561b8a"},"schema_version":"1.0","source":{"id":"1707.04784","kind":"arxiv","version":2}},"canonical_sha256":"860896d063ca52a5c2428a4421bd6dd28c71ef816c6b52bb95f46059348bf3d5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"860896d063ca52a5c2428a4421bd6dd28c71ef816c6b52bb95f46059348bf3d5","first_computed_at":"2026-05-18T00:16:50.661041Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:50.661041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FiEM/kzEP7JREPIje6wdsjg8RBLiW/tckfdd2UHI9pbFRiHD97L8LxjOHInyUXiDwwONC5NTal1w+7bS0QLIAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:50.662900Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.04784","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b4e26ae36c0bb840a844ea83bf2ec3065b5d3165363715c3d0f3ef0a1e5e46fa","sha256:0679b8c8666c08f7e6ca5de4f045f4415b3065f5c9ed7bd0d1f577d42348817b"],"state_sha256":"08c50d512e5fcbdddb0ef1f2d0f5cb413ce5b37fc5f29a245d9b07a2726413d6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VCbpR72aHP0dTRwQn+9rRMuCdwAY51Lz7B1HQ3ujcVVoudbo93E8HSS6nIkcq9i24k6wugRfcYkcfOFKcpv7Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T05:03:20.354356Z","bundle_sha256":"beedc3bfa8761a326498e6b6c17e60e6f2761068593749331042620e0342aebc"}}