{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:2BOOGVVAWD7QJANNRN4VUM3PDL","short_pith_number":"pith:2BOOGVVA","canonical_record":{"source":{"id":"1512.00859","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-12-02T21:00:10Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"3c97bb6fba852286cc101cb82a5d93c3af7300b318deb6b6184df05725f56272","abstract_canon_sha256":"e431a33c5bcb3f8007dbd3c20e56a7ee514188d0edd70d176979f056313f73a6"},"schema_version":"1.0"},"canonical_sha256":"d05ce356a0b0ff0481ad8b795a336f1ae004e910b0b817356e96bd0b0df123d0","source":{"kind":"arxiv","id":"1512.00859","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.00859","created_at":"2026-05-18T01:07:49Z"},{"alias_kind":"arxiv_version","alias_value":"1512.00859v2","created_at":"2026-05-18T01:07:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.00859","created_at":"2026-05-18T01:07:49Z"},{"alias_kind":"pith_short_12","alias_value":"2BOOGVVAWD7Q","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"2BOOGVVAWD7QJANN","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"2BOOGVVA","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:2BOOGVVAWD7QJANNRN4VUM3PDL","target":"record","payload":{"canonical_record":{"source":{"id":"1512.00859","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-12-02T21:00:10Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"3c97bb6fba852286cc101cb82a5d93c3af7300b318deb6b6184df05725f56272","abstract_canon_sha256":"e431a33c5bcb3f8007dbd3c20e56a7ee514188d0edd70d176979f056313f73a6"},"schema_version":"1.0"},"canonical_sha256":"d05ce356a0b0ff0481ad8b795a336f1ae004e910b0b817356e96bd0b0df123d0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:07:49.045025Z","signature_b64":"ZoFLAfXhwQObggPrmkgeBrLDPI8DWjzUz9ZKUqQZuwziwI+fHPDdiXvC7E8pR6K42gqKF57vIMinMrMHv/wbDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d05ce356a0b0ff0481ad8b795a336f1ae004e910b0b817356e96bd0b0df123d0","last_reissued_at":"2026-05-18T01:07:49.044535Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:07:49.044535Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.00859","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-18T01:07:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R0pTkzWKWckL5VsvFitVtVvWHyUmMCJnRvS0Q4fpQKGP2WycS4pZ8LrHMM1JX/Di5OgUU+S5icxhfPK0hUr5AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:53:05.786683Z"},"content_sha256":"34b7e18f04621d7e41aaa5b5cc680e83b7ef930c246ffbfe902c1e3fb5361e1d","schema_version":"1.0","event_id":"sha256:34b7e18f04621d7e41aaa5b5cc680e83b7ef930c246ffbfe902c1e3fb5361e1d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:2BOOGVVAWD7QJANNRN4VUM3PDL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster than Classical Quantum Algorithm for dense Formulas of Exact Satisfiability and Occupation Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Al\\'an Aspuru-Guzik, Gian Giacomo Guerreschi, Salvatore Mandr\\`a","submitted_at":"2015-12-02T21:00:10Z","abstract_excerpt":"We present an exact quantum algorithm for solving the Exact Satisfiability (XSAT) problem, which belongs to the important NP-complete complexity class. The algorithm is based on an intuitive approach that can be divided into two parts: First, the identification and efficient characterization of a restricted subspace that contains all the valid assignments of the XSAT; Second, a quantum search in such restricted subspace. The quantum algorithm can be used either to find a valid assignment (or to certify that no solution exists) or to count the total number of valid assignments. The query comple"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.00859","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-18T01:07:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wrGzVlC7pbEVyCql04oQlxZH4af32ZQgvzPien7nlqOzAwRXYCemfgOnEZf9HpW1i/nQIUaJfh+csX+5k+F4Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:53:05.787039Z"},"content_sha256":"e8f61dd66f7754861f860964cd9dc445c22b0b0fbdb197a76851a727b3d0fee5","schema_version":"1.0","event_id":"sha256:e8f61dd66f7754861f860964cd9dc445c22b0b0fbdb197a76851a727b3d0fee5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2BOOGVVAWD7QJANNRN4VUM3PDL/bundle.json","state_url":"https://pith.science/pith/2BOOGVVAWD7QJANNRN4VUM3PDL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2BOOGVVAWD7QJANNRN4VUM3PDL/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-28T14:53:05Z","links":{"resolver":"https://pith.science/pith/2BOOGVVAWD7QJANNRN4VUM3PDL","bundle":"https://pith.science/pith/2BOOGVVAWD7QJANNRN4VUM3PDL/bundle.json","state":"https://pith.science/pith/2BOOGVVAWD7QJANNRN4VUM3PDL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2BOOGVVAWD7QJANNRN4VUM3PDL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:2BOOGVVAWD7QJANNRN4VUM3PDL","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":"e431a33c5bcb3f8007dbd3c20e56a7ee514188d0edd70d176979f056313f73a6","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-12-02T21:00:10Z","title_canon_sha256":"3c97bb6fba852286cc101cb82a5d93c3af7300b318deb6b6184df05725f56272"},"schema_version":"1.0","source":{"id":"1512.00859","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.00859","created_at":"2026-05-18T01:07:49Z"},{"alias_kind":"arxiv_version","alias_value":"1512.00859v2","created_at":"2026-05-18T01:07:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.00859","created_at":"2026-05-18T01:07:49Z"},{"alias_kind":"pith_short_12","alias_value":"2BOOGVVAWD7Q","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"2BOOGVVAWD7QJANN","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"2BOOGVVA","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:e8f61dd66f7754861f860964cd9dc445c22b0b0fbdb197a76851a727b3d0fee5","target":"graph","created_at":"2026-05-18T01:07:49Z","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 present an exact quantum algorithm for solving the Exact Satisfiability (XSAT) problem, which belongs to the important NP-complete complexity class. The algorithm is based on an intuitive approach that can be divided into two parts: First, the identification and efficient characterization of a restricted subspace that contains all the valid assignments of the XSAT; Second, a quantum search in such restricted subspace. The quantum algorithm can be used either to find a valid assignment (or to certify that no solution exists) or to count the total number of valid assignments. The query comple","authors_text":"Al\\'an Aspuru-Guzik, Gian Giacomo Guerreschi, Salvatore Mandr\\`a","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-12-02T21:00:10Z","title":"Faster than Classical Quantum Algorithm for dense Formulas of Exact Satisfiability and Occupation Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.00859","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:34b7e18f04621d7e41aaa5b5cc680e83b7ef930c246ffbfe902c1e3fb5361e1d","target":"record","created_at":"2026-05-18T01:07:49Z","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":"e431a33c5bcb3f8007dbd3c20e56a7ee514188d0edd70d176979f056313f73a6","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-12-02T21:00:10Z","title_canon_sha256":"3c97bb6fba852286cc101cb82a5d93c3af7300b318deb6b6184df05725f56272"},"schema_version":"1.0","source":{"id":"1512.00859","kind":"arxiv","version":2}},"canonical_sha256":"d05ce356a0b0ff0481ad8b795a336f1ae004e910b0b817356e96bd0b0df123d0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d05ce356a0b0ff0481ad8b795a336f1ae004e910b0b817356e96bd0b0df123d0","first_computed_at":"2026-05-18T01:07:49.044535Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:07:49.044535Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZoFLAfXhwQObggPrmkgeBrLDPI8DWjzUz9ZKUqQZuwziwI+fHPDdiXvC7E8pR6K42gqKF57vIMinMrMHv/wbDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:07:49.045025Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.00859","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:34b7e18f04621d7e41aaa5b5cc680e83b7ef930c246ffbfe902c1e3fb5361e1d","sha256:e8f61dd66f7754861f860964cd9dc445c22b0b0fbdb197a76851a727b3d0fee5"],"state_sha256":"dcd582cacd302424f41f66f0b69b7736a67a101653c578aaa5cd9de6f896cf9d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4aLxSlnh0tzZZlZro9CeuTEtuw/zaUcYT+slxE+sStrx9pf92PuXssHrhrDPAN7c+2K0HNNkj4ym9qU02GY8DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T14:53:05.789037Z","bundle_sha256":"7e59e0e1e9a67a4d8ab65c4aad045f3b4b17f445b839608823f69116fa891c7e"}}