{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:TGLOMWSRITVP7E323DURZ2KSP5","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":"dc4428420513a09710b727f3c297a3a58465a260eb4b51d623b4a4975aff80c6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-07-20T07:21:04Z","title_canon_sha256":"d34b6a20f38472abba9b32325f1294c78c11e1627f092807a9b11be39b95b214"},"schema_version":"1.0","source":{"id":"1807.07721","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.07721","created_at":"2026-05-18T00:10:15Z"},{"alias_kind":"arxiv_version","alias_value":"1807.07721v1","created_at":"2026-05-18T00:10:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.07721","created_at":"2026-05-18T00:10:15Z"},{"alias_kind":"pith_short_12","alias_value":"TGLOMWSRITVP","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"TGLOMWSRITVP7E32","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"TGLOMWSR","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:6ff5693263a429ac559c2a4fde5830b4362a2056a455a7465942a1e92aad6abb","target":"graph","created_at":"2026-05-18T00:10:15Z","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":"Given a discrete source distribution $\\mu$ and discrete target distribution $\\nu$ on a common finite state space $\\mathcal{X}$, we are tasked with transporting $\\mu$ to $\\nu$ using a given discrete-time Markov chain $X$ with the quickest possible time on average. We define the optimal transport time $H(\\mu,\\nu)$ as stopping rule of $X$ that gives the minimial expected transport time. This is also known as the access time from $\\mu$ to $\\nu$ of $X$ in [L. Lov\\'{a}sz and P. Winkler. Efficient Stopping Rules for Markov Chains. Proceedings of the Twenty-seventh Annual ACM Symposium on Theory of Co","authors_text":"Michael C.H. Choi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-07-20T07:21:04Z","title":"Hitting time, access time and optimal transport on graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.07721","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:b54223991222b1fb951f4acc052f7c512d62e288db5dddcdee990fca7ba0c10a","target":"record","created_at":"2026-05-18T00:10:15Z","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":"dc4428420513a09710b727f3c297a3a58465a260eb4b51d623b4a4975aff80c6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-07-20T07:21:04Z","title_canon_sha256":"d34b6a20f38472abba9b32325f1294c78c11e1627f092807a9b11be39b95b214"},"schema_version":"1.0","source":{"id":"1807.07721","kind":"arxiv","version":1}},"canonical_sha256":"9996e65a5144eaff937ad8e91ce9527f7954922e724b1fd36f9a4ae372189e6e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9996e65a5144eaff937ad8e91ce9527f7954922e724b1fd36f9a4ae372189e6e","first_computed_at":"2026-05-18T00:10:15.817427Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:15.817427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gHJ3G/ratDscWo2lmCIe+6ZLpqYG3ZhDYeqHEmr9mPHsUx8lN6kNGAgurzswonXz5nmShWvZkAfovOQPwbkFAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:15.818133Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.07721","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b54223991222b1fb951f4acc052f7c512d62e288db5dddcdee990fca7ba0c10a","sha256:6ff5693263a429ac559c2a4fde5830b4362a2056a455a7465942a1e92aad6abb"],"state_sha256":"dd22bc72e825291b9e67cf5d2b07a555f8e774f571757b30ffe06f839e93de25"}