{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:33NMSU6MA6WTAYZFVJOGBRPAMS","short_pith_number":"pith:33NMSU6M","canonical_record":{"source":{"id":"1503.01334","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2015-03-04T15:07:07Z","cross_cats_sorted":["cs.AI","cs.DS"],"title_canon_sha256":"7bb4534e6c3451739b57eed2affc13ac686cd217a44fa6d08d4807caa5755f9b","abstract_canon_sha256":"5ed71d4bccb74f3e3b747077406d0370d68b78b98d9ac85c4efaadd5228c341d"},"schema_version":"1.0"},"canonical_sha256":"dedac953cc07ad306325aa5c60c5e064acf1f576c6c15ce9326bdcdb636abd7c","source":{"kind":"arxiv","id":"1503.01334","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.01334","created_at":"2026-05-18T00:00:45Z"},{"alias_kind":"arxiv_version","alias_value":"1503.01334v4","created_at":"2026-05-18T00:00:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01334","created_at":"2026-05-18T00:00:45Z"},{"alias_kind":"pith_short_12","alias_value":"33NMSU6MA6WT","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"33NMSU6MA6WTAYZF","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"33NMSU6M","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:33NMSU6MA6WTAYZFVJOGBRPAMS","target":"record","payload":{"canonical_record":{"source":{"id":"1503.01334","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2015-03-04T15:07:07Z","cross_cats_sorted":["cs.AI","cs.DS"],"title_canon_sha256":"7bb4534e6c3451739b57eed2affc13ac686cd217a44fa6d08d4807caa5755f9b","abstract_canon_sha256":"5ed71d4bccb74f3e3b747077406d0370d68b78b98d9ac85c4efaadd5228c341d"},"schema_version":"1.0"},"canonical_sha256":"dedac953cc07ad306325aa5c60c5e064acf1f576c6c15ce9326bdcdb636abd7c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:45.528412Z","signature_b64":"nQt4ytQKdD45fv/Cjqc0YJ+7n65aE14G2ME5hNcA+Lk0rGUOPZgCvMVgi3o7F6Q/MrDe4IizMhw2dCKLfrchCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dedac953cc07ad306325aa5c60c5e064acf1f576c6c15ce9326bdcdb636abd7c","last_reissued_at":"2026-05-18T00:00:45.527997Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:45.527997Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.01334","source_version":4,"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:00:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HOpUFI3xgAaY4FYWlotmvFHBSCH7owI+jQs5pW1mo6Oas6mY7lIHgomy9eRozB8cnPdg0fmJYgkASUC9OmAjAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:05:14.801061Z"},"content_sha256":"613a3b9e4af6bcdafb761152a6d6ede12a0205873e429869789f5ea592676b3d","schema_version":"1.0","event_id":"sha256:613a3b9e4af6bcdafb761152a6d6ede12a0205873e429869789f5ea592676b3d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:33NMSU6MA6WTAYZFVJOGBRPAMS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster quantum mixing for slowly evolving sequences of Markov chains","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.AI","cs.DS"],"primary_cat":"quant-ph","authors_text":"Davide Orsucci, Hans J. Briegel, Vedran Dunjko","submitted_at":"2015-03-04T15:07:07Z","abstract_excerpt":"Markov chain methods are remarkably successful in computational physics, machine learning, and combinatorial optimization. The cost of such methods often reduces to the mixing time, i.e., the time required to reach the steady state of the Markov chain, which scales as $\\delta^{-1}$, the inverse of the spectral gap. It has long been conjectured that quantum computers offer nearly generic quadratic improvements for mixing problems. However, except in special cases, quantum algorithms achieve a run-time of $\\mathcal{O}(\\sqrt{\\delta^{-1}} \\sqrt{N})$, which introduces a costly dependence on the Mar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.01334","kind":"arxiv","version":4},"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:00:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z5apapRi1Xvwytlp3tEsqdn5h2RyB+dahACyI/rmmqD/XRE7oGlpxQi/TYzHwoDqxrX3OeNX3NMstYHEhohNAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:05:14.801834Z"},"content_sha256":"375b1c1bd755af8091eb171301a2403eb2baf474d38c20b619b7eb5106b0f887","schema_version":"1.0","event_id":"sha256:375b1c1bd755af8091eb171301a2403eb2baf474d38c20b619b7eb5106b0f887"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/33NMSU6MA6WTAYZFVJOGBRPAMS/bundle.json","state_url":"https://pith.science/pith/33NMSU6MA6WTAYZFVJOGBRPAMS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/33NMSU6MA6WTAYZFVJOGBRPAMS/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-05-26T00:05:14Z","links":{"resolver":"https://pith.science/pith/33NMSU6MA6WTAYZFVJOGBRPAMS","bundle":"https://pith.science/pith/33NMSU6MA6WTAYZFVJOGBRPAMS/bundle.json","state":"https://pith.science/pith/33NMSU6MA6WTAYZFVJOGBRPAMS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/33NMSU6MA6WTAYZFVJOGBRPAMS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:33NMSU6MA6WTAYZFVJOGBRPAMS","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":"5ed71d4bccb74f3e3b747077406d0370d68b78b98d9ac85c4efaadd5228c341d","cross_cats_sorted":["cs.AI","cs.DS"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2015-03-04T15:07:07Z","title_canon_sha256":"7bb4534e6c3451739b57eed2affc13ac686cd217a44fa6d08d4807caa5755f9b"},"schema_version":"1.0","source":{"id":"1503.01334","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.01334","created_at":"2026-05-18T00:00:45Z"},{"alias_kind":"arxiv_version","alias_value":"1503.01334v4","created_at":"2026-05-18T00:00:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01334","created_at":"2026-05-18T00:00:45Z"},{"alias_kind":"pith_short_12","alias_value":"33NMSU6MA6WT","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"33NMSU6MA6WTAYZF","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"33NMSU6M","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:375b1c1bd755af8091eb171301a2403eb2baf474d38c20b619b7eb5106b0f887","target":"graph","created_at":"2026-05-18T00:00:45Z","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":"Markov chain methods are remarkably successful in computational physics, machine learning, and combinatorial optimization. The cost of such methods often reduces to the mixing time, i.e., the time required to reach the steady state of the Markov chain, which scales as $\\delta^{-1}$, the inverse of the spectral gap. It has long been conjectured that quantum computers offer nearly generic quadratic improvements for mixing problems. However, except in special cases, quantum algorithms achieve a run-time of $\\mathcal{O}(\\sqrt{\\delta^{-1}} \\sqrt{N})$, which introduces a costly dependence on the Mar","authors_text":"Davide Orsucci, Hans J. Briegel, Vedran Dunjko","cross_cats":["cs.AI","cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2015-03-04T15:07:07Z","title":"Faster quantum mixing for slowly evolving sequences of Markov chains"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.01334","kind":"arxiv","version":4},"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:613a3b9e4af6bcdafb761152a6d6ede12a0205873e429869789f5ea592676b3d","target":"record","created_at":"2026-05-18T00:00:45Z","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":"5ed71d4bccb74f3e3b747077406d0370d68b78b98d9ac85c4efaadd5228c341d","cross_cats_sorted":["cs.AI","cs.DS"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2015-03-04T15:07:07Z","title_canon_sha256":"7bb4534e6c3451739b57eed2affc13ac686cd217a44fa6d08d4807caa5755f9b"},"schema_version":"1.0","source":{"id":"1503.01334","kind":"arxiv","version":4}},"canonical_sha256":"dedac953cc07ad306325aa5c60c5e064acf1f576c6c15ce9326bdcdb636abd7c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dedac953cc07ad306325aa5c60c5e064acf1f576c6c15ce9326bdcdb636abd7c","first_computed_at":"2026-05-18T00:00:45.527997Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:45.527997Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nQt4ytQKdD45fv/Cjqc0YJ+7n65aE14G2ME5hNcA+Lk0rGUOPZgCvMVgi3o7F6Q/MrDe4IizMhw2dCKLfrchCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:45.528412Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.01334","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:613a3b9e4af6bcdafb761152a6d6ede12a0205873e429869789f5ea592676b3d","sha256:375b1c1bd755af8091eb171301a2403eb2baf474d38c20b619b7eb5106b0f887"],"state_sha256":"94962ea454e36a1ccd5d73c586abeaf218f2cd1569e7b3a3a462375b5434f259"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"js6JLVMdG0AG7WdX3p4FEedkzk+KJPzrex0Nm+rTzAkOJ1339PHfAIMUgF6a7WUArCRfesXxQOQebzXA8gxhBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T00:05:14.805684Z","bundle_sha256":"c603d579f82d95474a52694a11100f37627b81ad2bdf877a908cd1fe385a7548"}}