{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:PV6BW2Q5MUO4BB6S5QUPA5GWYN","short_pith_number":"pith:PV6BW2Q5","canonical_record":{"source":{"id":"1508.07338","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-08-28T20:32:36Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"aa9cbd2808f29d0e21831abc8f69bafdc84504eca5666f66d66e7b57202553f2","abstract_canon_sha256":"e9d1f399579c2c838c0ecfba89475ae6722664f23786d33e94c17736b41acdff"},"schema_version":"1.0"},"canonical_sha256":"7d7c1b6a1d651dc087d2ec28f074d6c359f9c22ff14bdebf70c591ac65c26649","source":{"kind":"arxiv","id":"1508.07338","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.07338","created_at":"2026-05-18T01:01:34Z"},{"alias_kind":"arxiv_version","alias_value":"1508.07338v1","created_at":"2026-05-18T01:01:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.07338","created_at":"2026-05-18T01:01:34Z"},{"alias_kind":"pith_short_12","alias_value":"PV6BW2Q5MUO4","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PV6BW2Q5MUO4BB6S","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PV6BW2Q5","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:PV6BW2Q5MUO4BB6S5QUPA5GWYN","target":"record","payload":{"canonical_record":{"source":{"id":"1508.07338","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-08-28T20:32:36Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"aa9cbd2808f29d0e21831abc8f69bafdc84504eca5666f66d66e7b57202553f2","abstract_canon_sha256":"e9d1f399579c2c838c0ecfba89475ae6722664f23786d33e94c17736b41acdff"},"schema_version":"1.0"},"canonical_sha256":"7d7c1b6a1d651dc087d2ec28f074d6c359f9c22ff14bdebf70c591ac65c26649","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:34.633523Z","signature_b64":"2fLG8OYUzd1/3Df9AAPUqQ2ETP7Gf7UjDyGh5+u91xndYAsxvZ2hlGituAGzgUXv1NOgg41MAa/xVKUf9+HIBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d7c1b6a1d651dc087d2ec28f074d6c359f9c22ff14bdebf70c591ac65c26649","last_reissued_at":"2026-05-18T01:01:34.632967Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:34.632967Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.07338","source_version":1,"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:01:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8pvR66kGD9WugKvXkqK2vA5qQQgVYULrCHC0c8V/DfSbyXpr20MauZ0Q8DAa3p8XFYsVtNxLsTonuqogvzBlBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T07:28:44.432675Z"},"content_sha256":"b2870f8078580b78fccc100b1a5c849ba0949f6b20c022430b6d2a0937c25269","schema_version":"1.0","event_id":"sha256:b2870f8078580b78fccc100b1a5c849ba0949f6b20c022430b6d2a0937c25269"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:PV6BW2Q5MUO4BB6S5QUPA5GWYN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A linear time algorithm for quantum 2-SAT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"quant-ph","authors_text":"Niel de Beaudrap, Sevag Gharibian","submitted_at":"2015-08-28T20:32:36Z","abstract_excerpt":"The Boolean constraint satisfaction problem 3-SAT is arguably the canonical NP-complete problem. In contrast, 2-SAT can not only be decided in polynomial time, but in fact in deterministic linear time. In 2006, Bravyi proposed a physically motivated generalization of k-SAT to the quantum setting, defining the problem \"quantum k-SAT\". He showed that quantum 2-SAT is also solvable in polynomial time on a classical computer, in particular in deterministic time O(n^4), assuming unit-cost arithmetic over a field extension of the rational numbers, where n is number of variables. In this paper, we pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.07338","kind":"arxiv","version":1},"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:01:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"krdeLj94wySsdCRNVbV+2XIS+Sg52DsImwusnROjTlRXIRpdqliIhrkM01xUD1gzqT/GkO9hLblASLfiDkiUBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T07:28:44.433025Z"},"content_sha256":"9be81cf7c73b704de90dc423f63013c266a6fa5e490e87d94582a327335dd7aa","schema_version":"1.0","event_id":"sha256:9be81cf7c73b704de90dc423f63013c266a6fa5e490e87d94582a327335dd7aa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PV6BW2Q5MUO4BB6S5QUPA5GWYN/bundle.json","state_url":"https://pith.science/pith/PV6BW2Q5MUO4BB6S5QUPA5GWYN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PV6BW2Q5MUO4BB6S5QUPA5GWYN/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-24T07:28:44Z","links":{"resolver":"https://pith.science/pith/PV6BW2Q5MUO4BB6S5QUPA5GWYN","bundle":"https://pith.science/pith/PV6BW2Q5MUO4BB6S5QUPA5GWYN/bundle.json","state":"https://pith.science/pith/PV6BW2Q5MUO4BB6S5QUPA5GWYN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PV6BW2Q5MUO4BB6S5QUPA5GWYN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:PV6BW2Q5MUO4BB6S5QUPA5GWYN","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":"e9d1f399579c2c838c0ecfba89475ae6722664f23786d33e94c17736b41acdff","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-08-28T20:32:36Z","title_canon_sha256":"aa9cbd2808f29d0e21831abc8f69bafdc84504eca5666f66d66e7b57202553f2"},"schema_version":"1.0","source":{"id":"1508.07338","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.07338","created_at":"2026-05-18T01:01:34Z"},{"alias_kind":"arxiv_version","alias_value":"1508.07338v1","created_at":"2026-05-18T01:01:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.07338","created_at":"2026-05-18T01:01:34Z"},{"alias_kind":"pith_short_12","alias_value":"PV6BW2Q5MUO4","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PV6BW2Q5MUO4BB6S","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PV6BW2Q5","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:9be81cf7c73b704de90dc423f63013c266a6fa5e490e87d94582a327335dd7aa","target":"graph","created_at":"2026-05-18T01:01:34Z","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":"The Boolean constraint satisfaction problem 3-SAT is arguably the canonical NP-complete problem. In contrast, 2-SAT can not only be decided in polynomial time, but in fact in deterministic linear time. In 2006, Bravyi proposed a physically motivated generalization of k-SAT to the quantum setting, defining the problem \"quantum k-SAT\". He showed that quantum 2-SAT is also solvable in polynomial time on a classical computer, in particular in deterministic time O(n^4), assuming unit-cost arithmetic over a field extension of the rational numbers, where n is number of variables. In this paper, we pr","authors_text":"Niel de Beaudrap, Sevag Gharibian","cross_cats":["cs.CC","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-08-28T20:32:36Z","title":"A linear time algorithm for quantum 2-SAT"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.07338","kind":"arxiv","version":1},"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:b2870f8078580b78fccc100b1a5c849ba0949f6b20c022430b6d2a0937c25269","target":"record","created_at":"2026-05-18T01:01:34Z","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":"e9d1f399579c2c838c0ecfba89475ae6722664f23786d33e94c17736b41acdff","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-08-28T20:32:36Z","title_canon_sha256":"aa9cbd2808f29d0e21831abc8f69bafdc84504eca5666f66d66e7b57202553f2"},"schema_version":"1.0","source":{"id":"1508.07338","kind":"arxiv","version":1}},"canonical_sha256":"7d7c1b6a1d651dc087d2ec28f074d6c359f9c22ff14bdebf70c591ac65c26649","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7d7c1b6a1d651dc087d2ec28f074d6c359f9c22ff14bdebf70c591ac65c26649","first_computed_at":"2026-05-18T01:01:34.632967Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:34.632967Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2fLG8OYUzd1/3Df9AAPUqQ2ETP7Gf7UjDyGh5+u91xndYAsxvZ2hlGituAGzgUXv1NOgg41MAa/xVKUf9+HIBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:34.633523Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.07338","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b2870f8078580b78fccc100b1a5c849ba0949f6b20c022430b6d2a0937c25269","sha256:9be81cf7c73b704de90dc423f63013c266a6fa5e490e87d94582a327335dd7aa"],"state_sha256":"67285f2fe1b2040049d82aa2f60b020d8ad6069892e3f6dd8ed5d6c6c8a10fe4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XruMEHJuyV2MINyUoQqSQQbKvD7+2XFLciQ6DbTATC7NPsn8n9wqeowOU95jnNAs8CTh+bOr8AqeMgxGrDR8Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T07:28:44.434932Z","bundle_sha256":"987a1d0e783fd592714338ab86774c638de683e895319bd8a3987e03d7054ff7"}}