{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:CJXWEOKX6PXVXYQJLTKO6DJSY3","short_pith_number":"pith:CJXWEOKX","schema_version":"1.0","canonical_sha256":"126f623957f3ef5be2095cd4ef0d32c6ebfa9935e180139ab553d63ff6d7024c","source":{"kind":"arxiv","id":"1405.3290","version":1},"attestation_state":"computed","paper":{"title":"Permuted Random Walk Exits Typically in Linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Shirshendu Ganguly, Yuval Peres","submitted_at":"2014-05-13T20:00:27Z","abstract_excerpt":"Given a permutation sigma of the integers {-n,-n+1,...,n} we consider the Markov chain X_{sigma}, which jumps from k to sigma (k\\pm 1) equally likely if k\\neq -n,n. We prove that the expected hitting time of {-n,n} starting from any point is Theta(n) with high probability when sigma is a uniformly chosen permutation. We prove this by showing that with high probability, the digraph of allowed transitions is an Eulerian expander; we then utilize general estimates of hitting times in directed Eulerian expanders."},"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":"1405.3290","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-05-13T20:00:27Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"7922c2d7a924c6a8ad26b613eb659586856b57d7a4c4d6ffdf059748205eb7ce","abstract_canon_sha256":"97636d313c4293e8849f27fee45d4db7b121207290e805f1eff3426ebf3c26af"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:56.461503Z","signature_b64":"F1jppI2Oa6NpJM/utaS0/ySgNM+wJlY1Lr4+yPFZ/b3sPcTqpK8SmsR3hQShT88SxGFiU3u2xbPJ6GyuOvhEDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"126f623957f3ef5be2095cd4ef0d32c6ebfa9935e180139ab553d63ff6d7024c","last_reissued_at":"2026-05-18T02:51:56.461064Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:56.461064Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Permuted Random Walk Exits Typically in Linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Shirshendu Ganguly, Yuval Peres","submitted_at":"2014-05-13T20:00:27Z","abstract_excerpt":"Given a permutation sigma of the integers {-n,-n+1,...,n} we consider the Markov chain X_{sigma}, which jumps from k to sigma (k\\pm 1) equally likely if k\\neq -n,n. We prove that the expected hitting time of {-n,n} starting from any point is Theta(n) with high probability when sigma is a uniformly chosen permutation. We prove this by showing that with high probability, the digraph of allowed transitions is an Eulerian expander; we then utilize general estimates of hitting times in directed Eulerian expanders."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.3290","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":"1405.3290","created_at":"2026-05-18T02:51:56.461130+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.3290v1","created_at":"2026-05-18T02:51:56.461130+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.3290","created_at":"2026-05-18T02:51:56.461130+00:00"},{"alias_kind":"pith_short_12","alias_value":"CJXWEOKX6PXV","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"CJXWEOKX6PXVXYQJ","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"CJXWEOKX","created_at":"2026-05-18T12:28:22.404517+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/CJXWEOKX6PXVXYQJLTKO6DJSY3","json":"https://pith.science/pith/CJXWEOKX6PXVXYQJLTKO6DJSY3.json","graph_json":"https://pith.science/api/pith-number/CJXWEOKX6PXVXYQJLTKO6DJSY3/graph.json","events_json":"https://pith.science/api/pith-number/CJXWEOKX6PXVXYQJLTKO6DJSY3/events.json","paper":"https://pith.science/paper/CJXWEOKX"},"agent_actions":{"view_html":"https://pith.science/pith/CJXWEOKX6PXVXYQJLTKO6DJSY3","download_json":"https://pith.science/pith/CJXWEOKX6PXVXYQJLTKO6DJSY3.json","view_paper":"https://pith.science/paper/CJXWEOKX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.3290&json=true","fetch_graph":"https://pith.science/api/pith-number/CJXWEOKX6PXVXYQJLTKO6DJSY3/graph.json","fetch_events":"https://pith.science/api/pith-number/CJXWEOKX6PXVXYQJLTKO6DJSY3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CJXWEOKX6PXVXYQJLTKO6DJSY3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CJXWEOKX6PXVXYQJLTKO6DJSY3/action/storage_attestation","attest_author":"https://pith.science/pith/CJXWEOKX6PXVXYQJLTKO6DJSY3/action/author_attestation","sign_citation":"https://pith.science/pith/CJXWEOKX6PXVXYQJLTKO6DJSY3/action/citation_signature","submit_replication":"https://pith.science/pith/CJXWEOKX6PXVXYQJLTKO6DJSY3/action/replication_record"}},"created_at":"2026-05-18T02:51:56.461130+00:00","updated_at":"2026-05-18T02:51:56.461130+00:00"}