{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:TGLOMWSRITVP7E323DURZ2KSP5","short_pith_number":"pith:TGLOMWSR","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"},"canonical_sha256":"9996e65a5144eaff937ad8e91ce9527f7954922e724b1fd36f9a4ae372189e6e","source":{"kind":"arxiv","id":"1807.07721","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:TGLOMWSRITVP7E323DURZ2KSP5","target":"record","payload":{"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"},"canonical_sha256":"9996e65a5144eaff937ad8e91ce9527f7954922e724b1fd36f9a4ae372189e6e","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"},"source_kind":"arxiv","source_id":"1807.07721","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-18T00:10:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"du3W/7i1Q1Lyqx1wAIT8c+pexrQOxl5w3Zx5wCg+h2g3TZKp8hNZLpr6bf/OaKZpj90YXAdco9GVuQuaOjGSBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:37:19.177473Z"},"content_sha256":"b54223991222b1fb951f4acc052f7c512d62e288db5dddcdee990fca7ba0c10a","schema_version":"1.0","event_id":"sha256:b54223991222b1fb951f4acc052f7c512d62e288db5dddcdee990fca7ba0c10a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:TGLOMWSRITVP7E323DURZ2KSP5","target":"graph","payload":{"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"},"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-18T00:10:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lUnBl2wIl1yhD/ZcEGGRhX3YT50/1FqsPzGhwF7/g82ff3oEW/chOh+/JwA/88OabvHOUcofAwx0qPrjC3gBBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:37:19.178169Z"},"content_sha256":"6ff5693263a429ac559c2a4fde5830b4362a2056a455a7465942a1e92aad6abb","schema_version":"1.0","event_id":"sha256:6ff5693263a429ac559c2a4fde5830b4362a2056a455a7465942a1e92aad6abb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TGLOMWSRITVP7E323DURZ2KSP5/bundle.json","state_url":"https://pith.science/pith/TGLOMWSRITVP7E323DURZ2KSP5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TGLOMWSRITVP7E323DURZ2KSP5/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-01T02:37:19Z","links":{"resolver":"https://pith.science/pith/TGLOMWSRITVP7E323DURZ2KSP5","bundle":"https://pith.science/pith/TGLOMWSRITVP7E323DURZ2KSP5/bundle.json","state":"https://pith.science/pith/TGLOMWSRITVP7E323DURZ2KSP5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TGLOMWSRITVP7E323DURZ2KSP5/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"18KH1SUwA57fgsOZxRJWbJHyCtA93hDuXmMw9kNDYOrPUW6UD2bSdWhnvSGK1dLZtE+TcxTNCRiiFs1OTUbhDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T02:37:19.181525Z","bundle_sha256":"e579a903ff215b8a85440910476fa39a7ccb571573cbbc67fb46e73346624a18"}}