{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:KHPPSJPKS3GUXHH7MIZDQKJ3YT","short_pith_number":"pith:KHPPSJPK","canonical_record":{"source":{"id":"1301.4956","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-01-21T18:44:41Z","cross_cats_sorted":[],"title_canon_sha256":"fb0afc4ba5a20b261144c3ca85e9462ded018dd9ee56c0ee0e828ffda1a936a4","abstract_canon_sha256":"3ccaeb249cc9229f17c532bce292dada6028e05747a1377f77804c16107f317d"},"schema_version":"1.0"},"canonical_sha256":"51def925ea96cd4b9cff623238293bc4dbef95ae150a59fbf3f832f073a1b045","source":{"kind":"arxiv","id":"1301.4956","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.4956","created_at":"2026-05-18T02:50:50Z"},{"alias_kind":"arxiv_version","alias_value":"1301.4956v2","created_at":"2026-05-18T02:50:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.4956","created_at":"2026-05-18T02:50:50Z"},{"alias_kind":"pith_short_12","alias_value":"KHPPSJPKS3GU","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"KHPPSJPKS3GUXHH7","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"KHPPSJPK","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:KHPPSJPKS3GUXHH7MIZDQKJ3YT","target":"record","payload":{"canonical_record":{"source":{"id":"1301.4956","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-01-21T18:44:41Z","cross_cats_sorted":[],"title_canon_sha256":"fb0afc4ba5a20b261144c3ca85e9462ded018dd9ee56c0ee0e828ffda1a936a4","abstract_canon_sha256":"3ccaeb249cc9229f17c532bce292dada6028e05747a1377f77804c16107f317d"},"schema_version":"1.0"},"canonical_sha256":"51def925ea96cd4b9cff623238293bc4dbef95ae150a59fbf3f832f073a1b045","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:50.627926Z","signature_b64":"w2nlqDKUf5QgEpdRgkHrLe9Msm8C4/6zB8TB1ihl2ksfhlMZcLj/gEVH2iPBsEggmgDGPK+wL6yEdPONTNo3Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51def925ea96cd4b9cff623238293bc4dbef95ae150a59fbf3f832f073a1b045","last_reissued_at":"2026-05-18T02:50:50.627478Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:50.627478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.4956","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-05-18T02:50:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vvJ3nVy5PbLzynBd3fA2H3QalyOeKRGiD0XOdF5dHLjS/IeEXmEEzEhFtu1oCxIyQJX+25Z9ZqqlK8efa/SpCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T19:25:45.254249Z"},"content_sha256":"1de50df4ba8a3dfa1844253c1d586df4cfb5549efbdc2aed2b3c2f8335021718","schema_version":"1.0","event_id":"sha256:1de50df4ba8a3dfa1844253c1d586df4cfb5549efbdc2aed2b3c2f8335021718"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:KHPPSJPKS3GUXHH7MIZDQKJ3YT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"How Fast Can Quantum Annealers Count?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Itay Hen","submitted_at":"2013-01-21T18:44:41Z","abstract_excerpt":"We outline an algorithm for the Quantum Counting problem using Adiabatic Quantum Computation (AQC). We show that using local adiabatic evolution, a process in which the adiabatic procedure is performed at a variable rate, the problem is solved with the same complexity as the analogous circuit-based algorithm, i.e., quadratically faster than the corresponding classical algorithm. The above algorithm provides further evidence for the potentially powerful capabilities of AQC as a paradigm for more efficient problem solving on a quantum computer, and may be used as the basis for solving more sophi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.4956","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":""},"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-18T02:50:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IkkRrtxOCf2h7YTKN64ZAQrexxgpy0erFTL1Nb2gNYbgBCLG/oJ8DfaTPGYUKkdr7gLkgPm2DdivDZ5TY4FVBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T19:25:45.254907Z"},"content_sha256":"e1030f31c1253be201775972665b5a46bda5d6a979536e260c4b3a1bc8126017","schema_version":"1.0","event_id":"sha256:e1030f31c1253be201775972665b5a46bda5d6a979536e260c4b3a1bc8126017"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KHPPSJPKS3GUXHH7MIZDQKJ3YT/bundle.json","state_url":"https://pith.science/pith/KHPPSJPKS3GUXHH7MIZDQKJ3YT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KHPPSJPKS3GUXHH7MIZDQKJ3YT/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-06T19:25:45Z","links":{"resolver":"https://pith.science/pith/KHPPSJPKS3GUXHH7MIZDQKJ3YT","bundle":"https://pith.science/pith/KHPPSJPKS3GUXHH7MIZDQKJ3YT/bundle.json","state":"https://pith.science/pith/KHPPSJPKS3GUXHH7MIZDQKJ3YT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KHPPSJPKS3GUXHH7MIZDQKJ3YT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:KHPPSJPKS3GUXHH7MIZDQKJ3YT","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":"3ccaeb249cc9229f17c532bce292dada6028e05747a1377f77804c16107f317d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-01-21T18:44:41Z","title_canon_sha256":"fb0afc4ba5a20b261144c3ca85e9462ded018dd9ee56c0ee0e828ffda1a936a4"},"schema_version":"1.0","source":{"id":"1301.4956","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.4956","created_at":"2026-05-18T02:50:50Z"},{"alias_kind":"arxiv_version","alias_value":"1301.4956v2","created_at":"2026-05-18T02:50:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.4956","created_at":"2026-05-18T02:50:50Z"},{"alias_kind":"pith_short_12","alias_value":"KHPPSJPKS3GU","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"KHPPSJPKS3GUXHH7","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"KHPPSJPK","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:e1030f31c1253be201775972665b5a46bda5d6a979536e260c4b3a1bc8126017","target":"graph","created_at":"2026-05-18T02:50:50Z","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":"We outline an algorithm for the Quantum Counting problem using Adiabatic Quantum Computation (AQC). We show that using local adiabatic evolution, a process in which the adiabatic procedure is performed at a variable rate, the problem is solved with the same complexity as the analogous circuit-based algorithm, i.e., quadratically faster than the corresponding classical algorithm. The above algorithm provides further evidence for the potentially powerful capabilities of AQC as a paradigm for more efficient problem solving on a quantum computer, and may be used as the basis for solving more sophi","authors_text":"Itay Hen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-01-21T18:44:41Z","title":"How Fast Can Quantum Annealers Count?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.4956","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:1de50df4ba8a3dfa1844253c1d586df4cfb5549efbdc2aed2b3c2f8335021718","target":"record","created_at":"2026-05-18T02:50:50Z","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":"3ccaeb249cc9229f17c532bce292dada6028e05747a1377f77804c16107f317d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-01-21T18:44:41Z","title_canon_sha256":"fb0afc4ba5a20b261144c3ca85e9462ded018dd9ee56c0ee0e828ffda1a936a4"},"schema_version":"1.0","source":{"id":"1301.4956","kind":"arxiv","version":2}},"canonical_sha256":"51def925ea96cd4b9cff623238293bc4dbef95ae150a59fbf3f832f073a1b045","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"51def925ea96cd4b9cff623238293bc4dbef95ae150a59fbf3f832f073a1b045","first_computed_at":"2026-05-18T02:50:50.627478Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:50:50.627478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"w2nlqDKUf5QgEpdRgkHrLe9Msm8C4/6zB8TB1ihl2ksfhlMZcLj/gEVH2iPBsEggmgDGPK+wL6yEdPONTNo3Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:50:50.627926Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.4956","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1de50df4ba8a3dfa1844253c1d586df4cfb5549efbdc2aed2b3c2f8335021718","sha256:e1030f31c1253be201775972665b5a46bda5d6a979536e260c4b3a1bc8126017"],"state_sha256":"4281ddb4603d95f7e0ee1fadf52903b5adbf3fc03dd6afd0d9220ca4fd57bdd1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gTLLb4LM68p8RBN5d0J5YEFhRgfd/EJBHszFNqdgAUeAtpHSsnrmPWBi4y4o6gEEFOW+ILijZbucQ1zkHkVRCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T19:25:45.258577Z","bundle_sha256":"385fdf595d3edca009030ca8e2441b7213f2b0038180b71e0532516bcd1ccd14"}}