{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:FYVOGPTTJDPRU6OVFJRXXKR5DK","short_pith_number":"pith:FYVOGPTT","schema_version":"1.0","canonical_sha256":"2e2ae33e7348df1a79d52a637baa3d1aaac87c1fa832cb47ee6ec5ad0c8ae643","source":{"kind":"arxiv","id":"1304.6704","version":1},"attestation_state":"computed","paper":{"title":"A permuted random walk exits faster","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Perla Sousi, Richard Pymar","submitted_at":"2013-04-24T19:38:25Z","abstract_excerpt":"Let $\\sigma$ be a permutation of $\\{0,\\ldots,n\\}$. We consider the Markov chain $X$ which jumps from $k\\neq 0,n$ to $\\sigma(k+1)$ or $\\sigma(k-1)$, equally likely. When $X$ is at 0 it jumps to either $\\sigma(0)$ or $\\sigma(1)$ equally likely, and when $X$ is at $n$ it jumps to either $\\sigma(n)$ or $\\sigma(n-1)$, equally likely. We show that the identity permutation maximizes the expected hitting time of n, when the walk starts at 0. More generally, we prove that the hitting time of a random walk on a strongly connected $d$-directed graph is maximized when the graph is the line $[0,n]\\cap\\Z$ w"},"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":"1304.6704","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-04-24T19:38:25Z","cross_cats_sorted":[],"title_canon_sha256":"34868c5aa1f7a2019aa1ac86bbf38664151fffee4567e15bbef91c39f1968c7c","abstract_canon_sha256":"3c14a3a95477151adc3131cf8d3b2cca3fc3a1968178bd51637ec522e40b5505"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:12.313061Z","signature_b64":"cT5QehZZO4/o0grE0T295JWnSBcSvxdOfiGK67HpOs8BgSAUH+vrLaMKpZKkRHzu3E4MUOPl4XQ9Xurv+pzhCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e2ae33e7348df1a79d52a637baa3d1aaac87c1fa832cb47ee6ec5ad0c8ae643","last_reissued_at":"2026-05-18T03:27:12.312387Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:12.312387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A permuted random walk exits faster","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Perla Sousi, Richard Pymar","submitted_at":"2013-04-24T19:38:25Z","abstract_excerpt":"Let $\\sigma$ be a permutation of $\\{0,\\ldots,n\\}$. We consider the Markov chain $X$ which jumps from $k\\neq 0,n$ to $\\sigma(k+1)$ or $\\sigma(k-1)$, equally likely. When $X$ is at 0 it jumps to either $\\sigma(0)$ or $\\sigma(1)$ equally likely, and when $X$ is at $n$ it jumps to either $\\sigma(n)$ or $\\sigma(n-1)$, equally likely. We show that the identity permutation maximizes the expected hitting time of n, when the walk starts at 0. More generally, we prove that the hitting time of a random walk on a strongly connected $d$-directed graph is maximized when the graph is the line $[0,n]\\cap\\Z$ w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.6704","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":"1304.6704","created_at":"2026-05-18T03:27:12.312502+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.6704v1","created_at":"2026-05-18T03:27:12.312502+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6704","created_at":"2026-05-18T03:27:12.312502+00:00"},{"alias_kind":"pith_short_12","alias_value":"FYVOGPTTJDPR","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"FYVOGPTTJDPRU6OV","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"FYVOGPTT","created_at":"2026-05-18T12:27:45.050594+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/FYVOGPTTJDPRU6OVFJRXXKR5DK","json":"https://pith.science/pith/FYVOGPTTJDPRU6OVFJRXXKR5DK.json","graph_json":"https://pith.science/api/pith-number/FYVOGPTTJDPRU6OVFJRXXKR5DK/graph.json","events_json":"https://pith.science/api/pith-number/FYVOGPTTJDPRU6OVFJRXXKR5DK/events.json","paper":"https://pith.science/paper/FYVOGPTT"},"agent_actions":{"view_html":"https://pith.science/pith/FYVOGPTTJDPRU6OVFJRXXKR5DK","download_json":"https://pith.science/pith/FYVOGPTTJDPRU6OVFJRXXKR5DK.json","view_paper":"https://pith.science/paper/FYVOGPTT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.6704&json=true","fetch_graph":"https://pith.science/api/pith-number/FYVOGPTTJDPRU6OVFJRXXKR5DK/graph.json","fetch_events":"https://pith.science/api/pith-number/FYVOGPTTJDPRU6OVFJRXXKR5DK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FYVOGPTTJDPRU6OVFJRXXKR5DK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FYVOGPTTJDPRU6OVFJRXXKR5DK/action/storage_attestation","attest_author":"https://pith.science/pith/FYVOGPTTJDPRU6OVFJRXXKR5DK/action/author_attestation","sign_citation":"https://pith.science/pith/FYVOGPTTJDPRU6OVFJRXXKR5DK/action/citation_signature","submit_replication":"https://pith.science/pith/FYVOGPTTJDPRU6OVFJRXXKR5DK/action/replication_record"}},"created_at":"2026-05-18T03:27:12.312502+00:00","updated_at":"2026-05-18T03:27:12.312502+00:00"}