{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:TGLOMWSRITVP7E323DURZ2KSP5","short_pith_number":"pith:TGLOMWSR","schema_version":"1.0","canonical_sha256":"9996e65a5144eaff937ad8e91ce9527f7954922e724b1fd36f9a4ae372189e6e","source":{"kind":"arxiv","id":"1807.07721","version":1},"attestation_state":"computed","paper":{"title":"Hitting time, access time and optimal transport on graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Michael C.H. Choi","submitted_at":"2018-07-20T07:21:04Z","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"},"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":"1807.07721","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-07-20T07:21:04Z","cross_cats_sorted":[],"title_canon_sha256":"d34b6a20f38472abba9b32325f1294c78c11e1627f092807a9b11be39b95b214","abstract_canon_sha256":"dc4428420513a09710b727f3c297a3a58465a260eb4b51d623b4a4975aff80c6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:15.818133Z","signature_b64":"gHJ3G/ratDscWo2lmCIe+6ZLpqYG3ZhDYeqHEmr9mPHsUx8lN6kNGAgurzswonXz5nmShWvZkAfovOQPwbkFAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9996e65a5144eaff937ad8e91ce9527f7954922e724b1fd36f9a4ae372189e6e","last_reissued_at":"2026-05-18T00:10:15.817427Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:15.817427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hitting time, access time and optimal transport on graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Michael C.H. Choi","submitted_at":"2018-07-20T07:21:04Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.07721","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":"1807.07721","created_at":"2026-05-18T00:10:15.817535+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.07721v1","created_at":"2026-05-18T00:10:15.817535+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.07721","created_at":"2026-05-18T00:10:15.817535+00:00"},{"alias_kind":"pith_short_12","alias_value":"TGLOMWSRITVP","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"TGLOMWSRITVP7E32","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"TGLOMWSR","created_at":"2026-05-18T12:32:53.628368+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/TGLOMWSRITVP7E323DURZ2KSP5","json":"https://pith.science/pith/TGLOMWSRITVP7E323DURZ2KSP5.json","graph_json":"https://pith.science/api/pith-number/TGLOMWSRITVP7E323DURZ2KSP5/graph.json","events_json":"https://pith.science/api/pith-number/TGLOMWSRITVP7E323DURZ2KSP5/events.json","paper":"https://pith.science/paper/TGLOMWSR"},"agent_actions":{"view_html":"https://pith.science/pith/TGLOMWSRITVP7E323DURZ2KSP5","download_json":"https://pith.science/pith/TGLOMWSRITVP7E323DURZ2KSP5.json","view_paper":"https://pith.science/paper/TGLOMWSR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.07721&json=true","fetch_graph":"https://pith.science/api/pith-number/TGLOMWSRITVP7E323DURZ2KSP5/graph.json","fetch_events":"https://pith.science/api/pith-number/TGLOMWSRITVP7E323DURZ2KSP5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TGLOMWSRITVP7E323DURZ2KSP5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TGLOMWSRITVP7E323DURZ2KSP5/action/storage_attestation","attest_author":"https://pith.science/pith/TGLOMWSRITVP7E323DURZ2KSP5/action/author_attestation","sign_citation":"https://pith.science/pith/TGLOMWSRITVP7E323DURZ2KSP5/action/citation_signature","submit_replication":"https://pith.science/pith/TGLOMWSRITVP7E323DURZ2KSP5/action/replication_record"}},"created_at":"2026-05-18T00:10:15.817535+00:00","updated_at":"2026-05-18T00:10:15.817535+00:00"}