{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:VQDKF4WDR7KAOWDG5WA3PPN65Q","short_pith_number":"pith:VQDKF4WD","canonical_record":{"source":{"id":"1907.09965","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-07-23T15:38:06Z","cross_cats_sorted":[],"title_canon_sha256":"8dee74226c279cf378d2c84fb12bc3b30741d1cf41803e7fbc326be7fc263b64","abstract_canon_sha256":"b287e056e11fd1a4bf2595441c81229d907cad8fec708bac429d2d145b5432c4"},"schema_version":"1.0"},"canonical_sha256":"ac06a2f2c38fd4075866ed81b7bdbeec34a049ac950984c064f7484292717cdf","source":{"kind":"arxiv","id":"1907.09965","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.09965","created_at":"2026-07-05T00:38:54Z"},{"alias_kind":"arxiv_version","alias_value":"1907.09965v2","created_at":"2026-07-05T00:38:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.09965","created_at":"2026-07-05T00:38:54Z"},{"alias_kind":"pith_short_12","alias_value":"VQDKF4WDR7KA","created_at":"2026-07-05T00:38:54Z"},{"alias_kind":"pith_short_16","alias_value":"VQDKF4WDR7KAOWDG","created_at":"2026-07-05T00:38:54Z"},{"alias_kind":"pith_short_8","alias_value":"VQDKF4WD","created_at":"2026-07-05T00:38:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:VQDKF4WDR7KAOWDG5WA3PPN65Q","target":"record","payload":{"canonical_record":{"source":{"id":"1907.09965","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-07-23T15:38:06Z","cross_cats_sorted":[],"title_canon_sha256":"8dee74226c279cf378d2c84fb12bc3b30741d1cf41803e7fbc326be7fc263b64","abstract_canon_sha256":"b287e056e11fd1a4bf2595441c81229d907cad8fec708bac429d2d145b5432c4"},"schema_version":"1.0"},"canonical_sha256":"ac06a2f2c38fd4075866ed81b7bdbeec34a049ac950984c064f7484292717cdf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:38:54.355274Z","signature_b64":"kUfbHhwgoQyi+KkVXa1AEnND9e9vzOMhKEHvvJe6EdS1IzLo2SwLKjiusMGOw43ZnyJ6VIMzT0Crlr9OiAApCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac06a2f2c38fd4075866ed81b7bdbeec34a049ac950984c064f7484292717cdf","last_reissued_at":"2026-07-05T00:38:54.354821Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:38:54.354821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.09965","source_version":2,"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-07-05T00:38:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I0UXYZYAQ5oV4VBe5LGXWYEbWZKJ+ANbeER/9g6s6xeofeJu/nzdBDKBM2mW7/PM15PNphpGk/nfWPu8Lgd6Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T19:59:03.278923Z"},"content_sha256":"e106e28bb2bd6e926a820eb7203281c431986f08e9e4b677bdf0b9280bd705b7","schema_version":"1.0","event_id":"sha256:e106e28bb2bd6e926a820eb7203281c431986f08e9e4b677bdf0b9280bd705b7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:VQDKF4WDR7KAOWDG5WA3PPN65Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adaptive Quantum Simulated Annealing for Bayesian Inference and Estimating Partition Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Annie Y. Wei, Aram W. Harrow","submitted_at":"2019-07-23T15:38:06Z","abstract_excerpt":"Markov chain Monte Carlo algorithms have important applications in counting problems and in machine learning problems, settings that involve estimating quantities that are difficult to compute exactly. How much can quantum computers speed up classical Markov chain algorithms? In this work we consider the problem of speeding up simulated annealing algorithms, where the stationary distributions of the Markov chains are Gibbs distributions at temperatures specified according to an annealing schedule.\n  We construct a quantum algorithm that both adaptively constructs an annealing schedule and quan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.09965","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1907.09965/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:38:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8mrMtEAkGWD4GhDxkpmu6yN5Y0kBywFrfVdGoFiqLi4A5hIgmhPfKYS+nIt/FHbwPlivTIbPOYcAGxBp3XVsBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T19:59:03.280961Z"},"content_sha256":"5cd1be090f8adab68275f800141f801de72fa3d769210dd0a0adabf0648e2caa","schema_version":"1.0","event_id":"sha256:5cd1be090f8adab68275f800141f801de72fa3d769210dd0a0adabf0648e2caa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VQDKF4WDR7KAOWDG5WA3PPN65Q/bundle.json","state_url":"https://pith.science/pith/VQDKF4WDR7KAOWDG5WA3PPN65Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VQDKF4WDR7KAOWDG5WA3PPN65Q/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-08-15T19:59:03Z","links":{"resolver":"https://pith.science/pith/VQDKF4WDR7KAOWDG5WA3PPN65Q","bundle":"https://pith.science/pith/VQDKF4WDR7KAOWDG5WA3PPN65Q/bundle.json","state":"https://pith.science/pith/VQDKF4WDR7KAOWDG5WA3PPN65Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VQDKF4WDR7KAOWDG5WA3PPN65Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:VQDKF4WDR7KAOWDG5WA3PPN65Q","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":"b287e056e11fd1a4bf2595441c81229d907cad8fec708bac429d2d145b5432c4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-07-23T15:38:06Z","title_canon_sha256":"8dee74226c279cf378d2c84fb12bc3b30741d1cf41803e7fbc326be7fc263b64"},"schema_version":"1.0","source":{"id":"1907.09965","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.09965","created_at":"2026-07-05T00:38:54Z"},{"alias_kind":"arxiv_version","alias_value":"1907.09965v2","created_at":"2026-07-05T00:38:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.09965","created_at":"2026-07-05T00:38:54Z"},{"alias_kind":"pith_short_12","alias_value":"VQDKF4WDR7KA","created_at":"2026-07-05T00:38:54Z"},{"alias_kind":"pith_short_16","alias_value":"VQDKF4WDR7KAOWDG","created_at":"2026-07-05T00:38:54Z"},{"alias_kind":"pith_short_8","alias_value":"VQDKF4WD","created_at":"2026-07-05T00:38:54Z"}],"graph_snapshots":[{"event_id":"sha256:5cd1be090f8adab68275f800141f801de72fa3d769210dd0a0adabf0648e2caa","target":"graph","created_at":"2026-07-05T00:38:54Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1907.09965/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Markov chain Monte Carlo algorithms have important applications in counting problems and in machine learning problems, settings that involve estimating quantities that are difficult to compute exactly. How much can quantum computers speed up classical Markov chain algorithms? In this work we consider the problem of speeding up simulated annealing algorithms, where the stationary distributions of the Markov chains are Gibbs distributions at temperatures specified according to an annealing schedule.\n  We construct a quantum algorithm that both adaptively constructs an annealing schedule and quan","authors_text":"Annie Y. Wei, Aram W. Harrow","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-07-23T15:38:06Z","title":"Adaptive Quantum Simulated Annealing for Bayesian Inference and Estimating Partition Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.09965","kind":"arxiv","version":2},"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:e106e28bb2bd6e926a820eb7203281c431986f08e9e4b677bdf0b9280bd705b7","target":"record","created_at":"2026-07-05T00:38:54Z","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":"b287e056e11fd1a4bf2595441c81229d907cad8fec708bac429d2d145b5432c4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-07-23T15:38:06Z","title_canon_sha256":"8dee74226c279cf378d2c84fb12bc3b30741d1cf41803e7fbc326be7fc263b64"},"schema_version":"1.0","source":{"id":"1907.09965","kind":"arxiv","version":2}},"canonical_sha256":"ac06a2f2c38fd4075866ed81b7bdbeec34a049ac950984c064f7484292717cdf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ac06a2f2c38fd4075866ed81b7bdbeec34a049ac950984c064f7484292717cdf","first_computed_at":"2026-07-05T00:38:54.354821Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:38:54.354821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kUfbHhwgoQyi+KkVXa1AEnND9e9vzOMhKEHvvJe6EdS1IzLo2SwLKjiusMGOw43ZnyJ6VIMzT0Crlr9OiAApCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:38:54.355274Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.09965","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e106e28bb2bd6e926a820eb7203281c431986f08e9e4b677bdf0b9280bd705b7","sha256:5cd1be090f8adab68275f800141f801de72fa3d769210dd0a0adabf0648e2caa"],"state_sha256":"ce5c910ba5cc7ac53dc881255d7fce347e4fe26abc629eb1152acc4f6896296f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W4RDbukaNq8IyYjpfU7tGgbmT5yhAtvAHTB9QZd+TLibADXzGC9+dQCC0QxEVud3kR2nXi+RoWQQtP5Yf8rXBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T19:59:03.287110Z","bundle_sha256":"81178cbb49d54c5be590a6ad5f8159bd177062d3b2f3283483668f72679745b4"}}