{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:KLJWLLB6BXHYAOSQ75N2WWXBZL","short_pith_number":"pith:KLJWLLB6","canonical_record":{"source":{"id":"1410.5112","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-19T21:07:28Z","cross_cats_sorted":[],"title_canon_sha256":"f008c808714cb0ebc2a8b06c2b6d906297875e16bbd598122e375de931288a00","abstract_canon_sha256":"dad49a60cb781cb8eb3493138fe51b8febb95d28ffcba6c90af24ba0b9ab72a3"},"schema_version":"1.0"},"canonical_sha256":"52d365ac3e0dcf803a50ff5bab5ae1cac480589412cb214199209e6d758e2e67","source":{"kind":"arxiv","id":"1410.5112","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.5112","created_at":"2026-05-18T02:39:46Z"},{"alias_kind":"arxiv_version","alias_value":"1410.5112v1","created_at":"2026-05-18T02:39:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.5112","created_at":"2026-05-18T02:39:46Z"},{"alias_kind":"pith_short_12","alias_value":"KLJWLLB6BXHY","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KLJWLLB6BXHYAOSQ","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KLJWLLB6","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:KLJWLLB6BXHYAOSQ75N2WWXBZL","target":"record","payload":{"canonical_record":{"source":{"id":"1410.5112","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-19T21:07:28Z","cross_cats_sorted":[],"title_canon_sha256":"f008c808714cb0ebc2a8b06c2b6d906297875e16bbd598122e375de931288a00","abstract_canon_sha256":"dad49a60cb781cb8eb3493138fe51b8febb95d28ffcba6c90af24ba0b9ab72a3"},"schema_version":"1.0"},"canonical_sha256":"52d365ac3e0dcf803a50ff5bab5ae1cac480589412cb214199209e6d758e2e67","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:46.885292Z","signature_b64":"fDjMSolrCmyfhxPofefXrr3fRooRv1OthEid4826xeepS47U35X09KhgoPQ/CQ3YmLSi9ss41Dk/hz2vdik7Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52d365ac3e0dcf803a50ff5bab5ae1cac480589412cb214199209e6d758e2e67","last_reissued_at":"2026-05-18T02:39:46.884887Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:46.884887Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.5112","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:39:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uNDvSosB2/fWGbex92X2da8RufX+ewpPZXoSpdolFN5upoQwDZEj/zDDedcpmb1iqQIdzCWXEZbDgHMg8kDaDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T00:31:45.949529Z"},"content_sha256":"e9c33fbbc567520d3a14149a43c19de7000972671ac4ea8636e91e8e8a3da4da","schema_version":"1.0","event_id":"sha256:e9c33fbbc567520d3a14149a43c19de7000972671ac4ea8636e91e8e8a3da4da"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:KLJWLLB6BXHYAOSQ75N2WWXBZL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Best Mixing Time for Random Walks on Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew Beveridge, Jeanmarie Youngblood","submitted_at":"2014-10-19T21:07:28Z","abstract_excerpt":"We characterize the extremal structures for mixing walks on trees that start from the most advantageous vertex. Let $G=(V,E)$ be a tree with stationary distribution $\\pi$. For a vertex $v \\in V$, let $H(v,\\pi)$ denote the expected length of an optimal stopping rule from $v$ to $\\pi$. The \\emph{best mixing time} for $G$ is $\\min_{v \\in V} H(v,\\pi)$. We show that among all trees with $|V|=n$, the best mixing time is minimized uniquely by the star. For even $n$, the best mixing time is maximized by the uniquely path. Surprising, for odd $n$, the best mixing time is maximized uniquely by a path of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.5112","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:39:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QZNPb2VLlmnSPmVzs9VGnZKLUcVoMIIqAk/K6k51naneWInfKg0e+r7cuaYekw+X63rjFintbtHQEZoMDGJ6BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T00:31:45.949877Z"},"content_sha256":"c40b65c863c8c43c209f50a7a01c8c6c2bef546e2d5339094a30cc2fa18ef5a9","schema_version":"1.0","event_id":"sha256:c40b65c863c8c43c209f50a7a01c8c6c2bef546e2d5339094a30cc2fa18ef5a9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KLJWLLB6BXHYAOSQ75N2WWXBZL/bundle.json","state_url":"https://pith.science/pith/KLJWLLB6BXHYAOSQ75N2WWXBZL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KLJWLLB6BXHYAOSQ75N2WWXBZL/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-02T00:31:45Z","links":{"resolver":"https://pith.science/pith/KLJWLLB6BXHYAOSQ75N2WWXBZL","bundle":"https://pith.science/pith/KLJWLLB6BXHYAOSQ75N2WWXBZL/bundle.json","state":"https://pith.science/pith/KLJWLLB6BXHYAOSQ75N2WWXBZL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KLJWLLB6BXHYAOSQ75N2WWXBZL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:KLJWLLB6BXHYAOSQ75N2WWXBZL","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":"dad49a60cb781cb8eb3493138fe51b8febb95d28ffcba6c90af24ba0b9ab72a3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-19T21:07:28Z","title_canon_sha256":"f008c808714cb0ebc2a8b06c2b6d906297875e16bbd598122e375de931288a00"},"schema_version":"1.0","source":{"id":"1410.5112","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.5112","created_at":"2026-05-18T02:39:46Z"},{"alias_kind":"arxiv_version","alias_value":"1410.5112v1","created_at":"2026-05-18T02:39:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.5112","created_at":"2026-05-18T02:39:46Z"},{"alias_kind":"pith_short_12","alias_value":"KLJWLLB6BXHY","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KLJWLLB6BXHYAOSQ","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KLJWLLB6","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:c40b65c863c8c43c209f50a7a01c8c6c2bef546e2d5339094a30cc2fa18ef5a9","target":"graph","created_at":"2026-05-18T02:39:46Z","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":"We characterize the extremal structures for mixing walks on trees that start from the most advantageous vertex. Let $G=(V,E)$ be a tree with stationary distribution $\\pi$. For a vertex $v \\in V$, let $H(v,\\pi)$ denote the expected length of an optimal stopping rule from $v$ to $\\pi$. The \\emph{best mixing time} for $G$ is $\\min_{v \\in V} H(v,\\pi)$. We show that among all trees with $|V|=n$, the best mixing time is minimized uniquely by the star. For even $n$, the best mixing time is maximized by the uniquely path. Surprising, for odd $n$, the best mixing time is maximized uniquely by a path of","authors_text":"Andrew Beveridge, Jeanmarie Youngblood","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-19T21:07:28Z","title":"The Best Mixing Time for Random Walks on Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.5112","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:e9c33fbbc567520d3a14149a43c19de7000972671ac4ea8636e91e8e8a3da4da","target":"record","created_at":"2026-05-18T02:39:46Z","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":"dad49a60cb781cb8eb3493138fe51b8febb95d28ffcba6c90af24ba0b9ab72a3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-19T21:07:28Z","title_canon_sha256":"f008c808714cb0ebc2a8b06c2b6d906297875e16bbd598122e375de931288a00"},"schema_version":"1.0","source":{"id":"1410.5112","kind":"arxiv","version":1}},"canonical_sha256":"52d365ac3e0dcf803a50ff5bab5ae1cac480589412cb214199209e6d758e2e67","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"52d365ac3e0dcf803a50ff5bab5ae1cac480589412cb214199209e6d758e2e67","first_computed_at":"2026-05-18T02:39:46.884887Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:39:46.884887Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fDjMSolrCmyfhxPofefXrr3fRooRv1OthEid4826xeepS47U35X09KhgoPQ/CQ3YmLSi9ss41Dk/hz2vdik7Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:39:46.885292Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.5112","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e9c33fbbc567520d3a14149a43c19de7000972671ac4ea8636e91e8e8a3da4da","sha256:c40b65c863c8c43c209f50a7a01c8c6c2bef546e2d5339094a30cc2fa18ef5a9"],"state_sha256":"8e0b6acf9e88110bc8ff05cec3cf058f3e5d8070540d68bf2b469099058fc4f2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SAXhD0lxjfrzKxYSts6iKrzTbzk4m+aF3KCZsYKbTkNRwnBTAzSDD8IrxUe4kLez3jbc/VdA/LSdErGVZVXGDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T00:31:45.951788Z","bundle_sha256":"3c7fbcb4e1608eab39776ea89e485f3a061082b83565a160f5463afec894680a"}}