{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:FYVOGPTTJDPRU6OVFJRXXKR5DK","short_pith_number":"pith:FYVOGPTT","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"},"canonical_sha256":"2e2ae33e7348df1a79d52a637baa3d1aaac87c1fa832cb47ee6ec5ad0c8ae643","source":{"kind":"arxiv","id":"1304.6704","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.6704","created_at":"2026-05-18T03:27:12Z"},{"alias_kind":"arxiv_version","alias_value":"1304.6704v1","created_at":"2026-05-18T03:27:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6704","created_at":"2026-05-18T03:27:12Z"},{"alias_kind":"pith_short_12","alias_value":"FYVOGPTTJDPR","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FYVOGPTTJDPRU6OV","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FYVOGPTT","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:FYVOGPTTJDPRU6OVFJRXXKR5DK","target":"record","payload":{"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"},"canonical_sha256":"2e2ae33e7348df1a79d52a637baa3d1aaac87c1fa832cb47ee6ec5ad0c8ae643","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"},"source_kind":"arxiv","source_id":"1304.6704","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-18T03:27:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8Nmz6GCSZ1JQFc8Bp33YF+5pNw1vpIEffzgwvKhtGSspHD22w0vLxglH+uwejV1wp41mPHrhpi+cj8BIfVSjBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T17:57:02.171951Z"},"content_sha256":"aa0e0a7dd668495fe82578055e4bb623c653f287852b131260424109dc526115","schema_version":"1.0","event_id":"sha256:aa0e0a7dd668495fe82578055e4bb623c653f287852b131260424109dc526115"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:FYVOGPTTJDPRU6OVFJRXXKR5DK","target":"graph","payload":{"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"},"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-18T03:27:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hosAgqPhvIux528qrOUoZWKuac2cj/SpmKtEeR5A8/08At7+EJZODCUGBVXCkZvZFIYr/UllKh9ZDa2j/YG2Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T17:57:02.172639Z"},"content_sha256":"43b419ef0d64d387b122c465d6b9f895e7a1985ad56fefa241e6fe1c39817cfb","schema_version":"1.0","event_id":"sha256:43b419ef0d64d387b122c465d6b9f895e7a1985ad56fefa241e6fe1c39817cfb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FYVOGPTTJDPRU6OVFJRXXKR5DK/bundle.json","state_url":"https://pith.science/pith/FYVOGPTTJDPRU6OVFJRXXKR5DK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FYVOGPTTJDPRU6OVFJRXXKR5DK/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-05-29T17:57:02Z","links":{"resolver":"https://pith.science/pith/FYVOGPTTJDPRU6OVFJRXXKR5DK","bundle":"https://pith.science/pith/FYVOGPTTJDPRU6OVFJRXXKR5DK/bundle.json","state":"https://pith.science/pith/FYVOGPTTJDPRU6OVFJRXXKR5DK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FYVOGPTTJDPRU6OVFJRXXKR5DK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:FYVOGPTTJDPRU6OVFJRXXKR5DK","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":"3c14a3a95477151adc3131cf8d3b2cca3fc3a1968178bd51637ec522e40b5505","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-04-24T19:38:25Z","title_canon_sha256":"34868c5aa1f7a2019aa1ac86bbf38664151fffee4567e15bbef91c39f1968c7c"},"schema_version":"1.0","source":{"id":"1304.6704","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.6704","created_at":"2026-05-18T03:27:12Z"},{"alias_kind":"arxiv_version","alias_value":"1304.6704v1","created_at":"2026-05-18T03:27:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6704","created_at":"2026-05-18T03:27:12Z"},{"alias_kind":"pith_short_12","alias_value":"FYVOGPTTJDPR","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FYVOGPTTJDPRU6OV","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FYVOGPTT","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:43b419ef0d64d387b122c465d6b9f895e7a1985ad56fefa241e6fe1c39817cfb","target":"graph","created_at":"2026-05-18T03:27:12Z","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":"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","authors_text":"Perla Sousi, Richard Pymar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-04-24T19:38:25Z","title":"A permuted random walk exits faster"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.6704","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:aa0e0a7dd668495fe82578055e4bb623c653f287852b131260424109dc526115","target":"record","created_at":"2026-05-18T03:27:12Z","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":"3c14a3a95477151adc3131cf8d3b2cca3fc3a1968178bd51637ec522e40b5505","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-04-24T19:38:25Z","title_canon_sha256":"34868c5aa1f7a2019aa1ac86bbf38664151fffee4567e15bbef91c39f1968c7c"},"schema_version":"1.0","source":{"id":"1304.6704","kind":"arxiv","version":1}},"canonical_sha256":"2e2ae33e7348df1a79d52a637baa3d1aaac87c1fa832cb47ee6ec5ad0c8ae643","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2e2ae33e7348df1a79d52a637baa3d1aaac87c1fa832cb47ee6ec5ad0c8ae643","first_computed_at":"2026-05-18T03:27:12.312387Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:12.312387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cT5QehZZO4/o0grE0T295JWnSBcSvxdOfiGK67HpOs8BgSAUH+vrLaMKpZKkRHzu3E4MUOPl4XQ9Xurv+pzhCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:12.313061Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.6704","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aa0e0a7dd668495fe82578055e4bb623c653f287852b131260424109dc526115","sha256:43b419ef0d64d387b122c465d6b9f895e7a1985ad56fefa241e6fe1c39817cfb"],"state_sha256":"e56932e2fa30dd1048abd6255fce9bb7698c59598ab969610348349be65dc663"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EfVJM4/dzn3Pi7j5DoWANaAmZsaDj7/ua9uqKj/WtvL6ayWa07PrmOYzknpw+DqWg0Ubd8Q3bSWDqcJDOmwsDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T17:57:02.176531Z","bundle_sha256":"8df79b356fb31e56a8be35659b18bb6670247074e825f0bf1dfb0680c0a3dd86"}}