{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:S46UXQW6LVVZ5K4LNI643PVH4C","short_pith_number":"pith:S46UXQW6","canonical_record":{"source":{"id":"1810.05582","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2018-10-12T15:40:57Z","cross_cats_sorted":[],"title_canon_sha256":"8c1da80df030606896190dfe49e27a01be86d5c1d1272b8fc777a2af33a95ddb","abstract_canon_sha256":"5c2c0f5a895b7da88e97b19874895d0b4dc45cab602bf2a418a9443a524bc263"},"schema_version":"1.0"},"canonical_sha256":"973d4bc2de5d6b9eab8b6a3dcdbea7e099207587c21e2404c82bf4de01909163","source":{"kind":"arxiv","id":"1810.05582","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.05582","created_at":"2026-05-17T23:39:48Z"},{"alias_kind":"arxiv_version","alias_value":"1810.05582v2","created_at":"2026-05-17T23:39:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.05582","created_at":"2026-05-17T23:39:48Z"},{"alias_kind":"pith_short_12","alias_value":"S46UXQW6LVVZ","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"S46UXQW6LVVZ5K4L","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"S46UXQW6","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:S46UXQW6LVVZ5K4LNI643PVH4C","target":"record","payload":{"canonical_record":{"source":{"id":"1810.05582","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2018-10-12T15:40:57Z","cross_cats_sorted":[],"title_canon_sha256":"8c1da80df030606896190dfe49e27a01be86d5c1d1272b8fc777a2af33a95ddb","abstract_canon_sha256":"5c2c0f5a895b7da88e97b19874895d0b4dc45cab602bf2a418a9443a524bc263"},"schema_version":"1.0"},"canonical_sha256":"973d4bc2de5d6b9eab8b6a3dcdbea7e099207587c21e2404c82bf4de01909163","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:48.291389Z","signature_b64":"1HV4yNW11exC4h4BpjOLAxQTk7m8O6Dg0W4nASoPmypnDnQzSeO6BMvClI/tDJCnFXzicDcw38nezoURqeq2Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"973d4bc2de5d6b9eab8b6a3dcdbea7e099207587c21e2404c82bf4de01909163","last_reissued_at":"2026-05-17T23:39:48.290809Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:48.290809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.05582","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-17T23:39:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W6APscwTqfDDCgJHwJtaVQl7Nq1KZvdmyx43VghqXMiSg+dYW0c4AeudE3CeQ1h0vRnv4AmGoNjYGDr2bPRnBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T18:42:41.271614Z"},"content_sha256":"574e3d902a1a390f7111166caab8c8e0ec1ebd7d355e2c26556f0c5c734872e0","schema_version":"1.0","event_id":"sha256:574e3d902a1a390f7111166caab8c8e0ec1ebd7d355e2c26556f0c5c734872e0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:S46UXQW6LVVZ5K4LNI643PVH4C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Applying quantum algorithms to constraint satisfaction problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ankur Khurana, Ashley Montanaro, Earl Campbell","submitted_at":"2018-10-12T15:40:57Z","abstract_excerpt":"Quantum algorithms can deliver asymptotic speedups over their classical counterparts. However, there are few cases where a substantial quantum speedup has been worked out in detail for reasonably-sized problems, when compared with the best classical algorithms and taking into account realistic hardware parameters and overheads for fault-tolerance. All known examples of such speedups correspond to problems related to simulation of quantum systems and cryptography. Here we apply general-purpose quantum algorithms for solving constraint satisfaction problems to two families of prototypical NP-com"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.05582","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-17T23:39:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eyIhxTV9Cvxm/YvngJazTHFcy0hmmogNjlE2ngvEWxw8rHSjhbfMZEz8vN19WlLevcsM7iQGILhobi1Ne4IXBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T18:42:41.271951Z"},"content_sha256":"faef4d2480f8ea1b50b73615bfc33e83c099192731a57e9fb9c910944d92ed02","schema_version":"1.0","event_id":"sha256:faef4d2480f8ea1b50b73615bfc33e83c099192731a57e9fb9c910944d92ed02"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S46UXQW6LVVZ5K4LNI643PVH4C/bundle.json","state_url":"https://pith.science/pith/S46UXQW6LVVZ5K4LNI643PVH4C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S46UXQW6LVVZ5K4LNI643PVH4C/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-27T18:42:41Z","links":{"resolver":"https://pith.science/pith/S46UXQW6LVVZ5K4LNI643PVH4C","bundle":"https://pith.science/pith/S46UXQW6LVVZ5K4LNI643PVH4C/bundle.json","state":"https://pith.science/pith/S46UXQW6LVVZ5K4LNI643PVH4C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S46UXQW6LVVZ5K4LNI643PVH4C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:S46UXQW6LVVZ5K4LNI643PVH4C","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":"5c2c0f5a895b7da88e97b19874895d0b4dc45cab602bf2a418a9443a524bc263","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2018-10-12T15:40:57Z","title_canon_sha256":"8c1da80df030606896190dfe49e27a01be86d5c1d1272b8fc777a2af33a95ddb"},"schema_version":"1.0","source":{"id":"1810.05582","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.05582","created_at":"2026-05-17T23:39:48Z"},{"alias_kind":"arxiv_version","alias_value":"1810.05582v2","created_at":"2026-05-17T23:39:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.05582","created_at":"2026-05-17T23:39:48Z"},{"alias_kind":"pith_short_12","alias_value":"S46UXQW6LVVZ","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"S46UXQW6LVVZ5K4L","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"S46UXQW6","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:faef4d2480f8ea1b50b73615bfc33e83c099192731a57e9fb9c910944d92ed02","target":"graph","created_at":"2026-05-17T23:39:48Z","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":"Quantum algorithms can deliver asymptotic speedups over their classical counterparts. However, there are few cases where a substantial quantum speedup has been worked out in detail for reasonably-sized problems, when compared with the best classical algorithms and taking into account realistic hardware parameters and overheads for fault-tolerance. All known examples of such speedups correspond to problems related to simulation of quantum systems and cryptography. Here we apply general-purpose quantum algorithms for solving constraint satisfaction problems to two families of prototypical NP-com","authors_text":"Ankur Khurana, Ashley Montanaro, Earl Campbell","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2018-10-12T15:40:57Z","title":"Applying quantum algorithms to constraint satisfaction problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.05582","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:574e3d902a1a390f7111166caab8c8e0ec1ebd7d355e2c26556f0c5c734872e0","target":"record","created_at":"2026-05-17T23:39:48Z","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":"5c2c0f5a895b7da88e97b19874895d0b4dc45cab602bf2a418a9443a524bc263","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2018-10-12T15:40:57Z","title_canon_sha256":"8c1da80df030606896190dfe49e27a01be86d5c1d1272b8fc777a2af33a95ddb"},"schema_version":"1.0","source":{"id":"1810.05582","kind":"arxiv","version":2}},"canonical_sha256":"973d4bc2de5d6b9eab8b6a3dcdbea7e099207587c21e2404c82bf4de01909163","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"973d4bc2de5d6b9eab8b6a3dcdbea7e099207587c21e2404c82bf4de01909163","first_computed_at":"2026-05-17T23:39:48.290809Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:48.290809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1HV4yNW11exC4h4BpjOLAxQTk7m8O6Dg0W4nASoPmypnDnQzSeO6BMvClI/tDJCnFXzicDcw38nezoURqeq2Aw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:48.291389Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.05582","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:574e3d902a1a390f7111166caab8c8e0ec1ebd7d355e2c26556f0c5c734872e0","sha256:faef4d2480f8ea1b50b73615bfc33e83c099192731a57e9fb9c910944d92ed02"],"state_sha256":"2bb549ac6e350253c1dc7d6f6c05c3697a0bf45203e0402bd68510eab136558c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TMp6D4/pV1AzU389vAr/ZhBX3Xp7tVUjL6qdhYAK7mYo+JTEt9TBlq/Co47CizE9mKg7sdEjkK1vBZzlwKxjCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T18:42:41.273803Z","bundle_sha256":"c740b8b663cc0631a3bd4c3ac75d750059ac2055e3cc450e02ad5a423acd1eac"}}