{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:S5RBAXCVPMF5G3ZWZTYFPEU3A2","short_pith_number":"pith:S5RBAXCV","schema_version":"1.0","canonical_sha256":"9762105c557b0bd36f36ccf057929b0684fcdeeb0c37befac8621bede4a5f194","source":{"kind":"arxiv","id":"0910.2058","version":2},"attestation_state":"computed","paper":{"title":"On product, generic and random generic quantum satisfiability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.CC"],"primary_cat":"quant-ph","authors_text":"A.M. L\\\"auchli, A. Scardicchio, C.R. Laumann, R. Moessner, S.L. Sondhi","submitted_at":"2009-10-12T15:12:52Z","abstract_excerpt":"We report a cluster of results on k-QSAT, the problem of quantum satisfiability for k-qubit projectors which generalizes classical satisfiability with k-bit clauses to the quantum setting. First we define the NP-complete problem of product satisfiability and give a geometrical criterion for deciding when a QSAT interaction graph is product satisfiable with positive probability. We show that the same criterion suffices to establish quantum satisfiability for all projectors. Second, we apply these results to the random graph ensemble with generic projectors and obtain improved lower bounds on th"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"0910.2058","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-10-12T15:12:52Z","cross_cats_sorted":["cond-mat.stat-mech","cs.CC"],"title_canon_sha256":"701a585f0dbe06ea226ae7a385e1d6bb2d2799a5a6815505e3bfdfa85aec79df","abstract_canon_sha256":"b6501abd715f75e5d9cf712e08ddc4d59734a6fb4170725b89419aaec69bf471"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T17:31:05.896008Z","signature_b64":"rexb4KmZinzaF10CtC3yFvCSNxIHmrmM447EGDe1Lhv4OB4C4zvkHo2w/qTh4lNK9X5HISe3QXUVC24loC+OAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9762105c557b0bd36f36ccf057929b0684fcdeeb0c37befac8621bede4a5f194","last_reissued_at":"2026-07-04T17:31:05.895576Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T17:31:05.895576Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On product, generic and random generic quantum satisfiability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.CC"],"primary_cat":"quant-ph","authors_text":"A.M. L\\\"auchli, A. Scardicchio, C.R. Laumann, R. Moessner, S.L. Sondhi","submitted_at":"2009-10-12T15:12:52Z","abstract_excerpt":"We report a cluster of results on k-QSAT, the problem of quantum satisfiability for k-qubit projectors which generalizes classical satisfiability with k-bit clauses to the quantum setting. First we define the NP-complete problem of product satisfiability and give a geometrical criterion for deciding when a QSAT interaction graph is product satisfiable with positive probability. We show that the same criterion suffices to establish quantum satisfiability for all projectors. Second, we apply these results to the random graph ensemble with generic projectors and obtain improved lower bounds on th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0910.2058","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/0910.2058/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0910.2058","created_at":"2026-07-04T17:31:05.895651+00:00"},{"alias_kind":"arxiv_version","alias_value":"0910.2058v2","created_at":"2026-07-04T17:31:05.895651+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.2058","created_at":"2026-07-04T17:31:05.895651+00:00"},{"alias_kind":"pith_short_12","alias_value":"S5RBAXCVPMF5","created_at":"2026-07-04T17:31:05.895651+00:00"},{"alias_kind":"pith_short_16","alias_value":"S5RBAXCVPMF5G3ZW","created_at":"2026-07-04T17:31:05.895651+00:00"},{"alias_kind":"pith_short_8","alias_value":"S5RBAXCV","created_at":"2026-07-04T17:31:05.895651+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/S5RBAXCVPMF5G3ZWZTYFPEU3A2","json":"https://pith.science/pith/S5RBAXCVPMF5G3ZWZTYFPEU3A2.json","graph_json":"https://pith.science/api/pith-number/S5RBAXCVPMF5G3ZWZTYFPEU3A2/graph.json","events_json":"https://pith.science/api/pith-number/S5RBAXCVPMF5G3ZWZTYFPEU3A2/events.json","paper":"https://pith.science/paper/S5RBAXCV"},"agent_actions":{"view_html":"https://pith.science/pith/S5RBAXCVPMF5G3ZWZTYFPEU3A2","download_json":"https://pith.science/pith/S5RBAXCVPMF5G3ZWZTYFPEU3A2.json","view_paper":"https://pith.science/paper/S5RBAXCV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0910.2058&json=true","fetch_graph":"https://pith.science/api/pith-number/S5RBAXCVPMF5G3ZWZTYFPEU3A2/graph.json","fetch_events":"https://pith.science/api/pith-number/S5RBAXCVPMF5G3ZWZTYFPEU3A2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S5RBAXCVPMF5G3ZWZTYFPEU3A2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S5RBAXCVPMF5G3ZWZTYFPEU3A2/action/storage_attestation","attest_author":"https://pith.science/pith/S5RBAXCVPMF5G3ZWZTYFPEU3A2/action/author_attestation","sign_citation":"https://pith.science/pith/S5RBAXCVPMF5G3ZWZTYFPEU3A2/action/citation_signature","submit_replication":"https://pith.science/pith/S5RBAXCVPMF5G3ZWZTYFPEU3A2/action/replication_record"}},"created_at":"2026-07-04T17:31:05.895651+00:00","updated_at":"2026-07-04T17:31:05.895651+00:00"}