{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:KLJWLLB6BXHYAOSQ75N2WWXBZL","short_pith_number":"pith:KLJWLLB6","schema_version":"1.0","canonical_sha256":"52d365ac3e0dcf803a50ff5bab5ae1cac480589412cb214199209e6d758e2e67","source":{"kind":"arxiv","id":"1410.5112","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1410.5112","created_at":"2026-05-18T02:39:46.884952+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.5112v1","created_at":"2026-05-18T02:39:46.884952+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.5112","created_at":"2026-05-18T02:39:46.884952+00:00"},{"alias_kind":"pith_short_12","alias_value":"KLJWLLB6BXHY","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"KLJWLLB6BXHYAOSQ","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"KLJWLLB6","created_at":"2026-05-18T12:28:35.611951+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/KLJWLLB6BXHYAOSQ75N2WWXBZL","json":"https://pith.science/pith/KLJWLLB6BXHYAOSQ75N2WWXBZL.json","graph_json":"https://pith.science/api/pith-number/KLJWLLB6BXHYAOSQ75N2WWXBZL/graph.json","events_json":"https://pith.science/api/pith-number/KLJWLLB6BXHYAOSQ75N2WWXBZL/events.json","paper":"https://pith.science/paper/KLJWLLB6"},"agent_actions":{"view_html":"https://pith.science/pith/KLJWLLB6BXHYAOSQ75N2WWXBZL","download_json":"https://pith.science/pith/KLJWLLB6BXHYAOSQ75N2WWXBZL.json","view_paper":"https://pith.science/paper/KLJWLLB6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.5112&json=true","fetch_graph":"https://pith.science/api/pith-number/KLJWLLB6BXHYAOSQ75N2WWXBZL/graph.json","fetch_events":"https://pith.science/api/pith-number/KLJWLLB6BXHYAOSQ75N2WWXBZL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KLJWLLB6BXHYAOSQ75N2WWXBZL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KLJWLLB6BXHYAOSQ75N2WWXBZL/action/storage_attestation","attest_author":"https://pith.science/pith/KLJWLLB6BXHYAOSQ75N2WWXBZL/action/author_attestation","sign_citation":"https://pith.science/pith/KLJWLLB6BXHYAOSQ75N2WWXBZL/action/citation_signature","submit_replication":"https://pith.science/pith/KLJWLLB6BXHYAOSQ75N2WWXBZL/action/replication_record"}},"created_at":"2026-05-18T02:39:46.884952+00:00","updated_at":"2026-05-18T02:39:46.884952+00:00"}