{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:XE3YLMPD7SS764K4IRCHND2BKQ","short_pith_number":"pith:XE3YLMPD","schema_version":"1.0","canonical_sha256":"b93785b1e3fca5ff715c4444768f415426fb86564d63dcf7c691f4a0ab25c02f","source":{"kind":"arxiv","id":"1405.7375","version":2},"attestation_state":"computed","paper":{"title":"Tensor Network Contractions for #SAT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.LO","math-ph","math.MP"],"primary_cat":"quant-ph","authors_text":"Jacob D. Biamonte, Jacob W. Turner, Jason Morton","submitted_at":"2014-05-28T20:00:25Z","abstract_excerpt":"The computational cost of counting the number of solutions satisfying a Boolean formula, which is a problem instance of #SAT, has proven subtle to quantify. Even when finding individual satisfying solutions is computationally easy (e.g. 2-SAT, which is in P), determining the number of solutions is #P-hard. Recently, computational methods simulating quantum systems experienced advancements due to the development of tensor network algorithms and associated quantum physics-inspired techniques. By these methods, we give an algorithm using an axiomatic tensor contraction language for n-variable #SA"},"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":"1405.7375","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-05-28T20:00:25Z","cross_cats_sorted":["cs.CC","cs.LO","math-ph","math.MP"],"title_canon_sha256":"24aced7786efb14bc4267185de4c5991eec2cc27014186a43ec4de652bf3a0be","abstract_canon_sha256":"d5faaa873fb4e0c45ee9a677b7de4877351789170408fd3ffa1fd4fb3542bacc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:26.545103Z","signature_b64":"gmoeOAEEey2jHGjREwX5MxUcCiW3+C6IuHu6q7DVYyvH4o+dvFjkqeYzEYtxgZFT/JZmqRJqj9S7BizR4asrBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b93785b1e3fca5ff715c4444768f415426fb86564d63dcf7c691f4a0ab25c02f","last_reissued_at":"2026-05-18T01:20:26.544533Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:26.544533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tensor Network Contractions for #SAT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.LO","math-ph","math.MP"],"primary_cat":"quant-ph","authors_text":"Jacob D. Biamonte, Jacob W. Turner, Jason Morton","submitted_at":"2014-05-28T20:00:25Z","abstract_excerpt":"The computational cost of counting the number of solutions satisfying a Boolean formula, which is a problem instance of #SAT, has proven subtle to quantify. Even when finding individual satisfying solutions is computationally easy (e.g. 2-SAT, which is in P), determining the number of solutions is #P-hard. Recently, computational methods simulating quantum systems experienced advancements due to the development of tensor network algorithms and associated quantum physics-inspired techniques. By these methods, we give an algorithm using an axiomatic tensor contraction language for n-variable #SA"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.7375","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1405.7375","created_at":"2026-05-18T01:20:26.544655+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.7375v2","created_at":"2026-05-18T01:20:26.544655+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.7375","created_at":"2026-05-18T01:20:26.544655+00:00"},{"alias_kind":"pith_short_12","alias_value":"XE3YLMPD7SS7","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"XE3YLMPD7SS764K4","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"XE3YLMPD","created_at":"2026-05-18T12:28:57.508820+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/XE3YLMPD7SS764K4IRCHND2BKQ","json":"https://pith.science/pith/XE3YLMPD7SS764K4IRCHND2BKQ.json","graph_json":"https://pith.science/api/pith-number/XE3YLMPD7SS764K4IRCHND2BKQ/graph.json","events_json":"https://pith.science/api/pith-number/XE3YLMPD7SS764K4IRCHND2BKQ/events.json","paper":"https://pith.science/paper/XE3YLMPD"},"agent_actions":{"view_html":"https://pith.science/pith/XE3YLMPD7SS764K4IRCHND2BKQ","download_json":"https://pith.science/pith/XE3YLMPD7SS764K4IRCHND2BKQ.json","view_paper":"https://pith.science/paper/XE3YLMPD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.7375&json=true","fetch_graph":"https://pith.science/api/pith-number/XE3YLMPD7SS764K4IRCHND2BKQ/graph.json","fetch_events":"https://pith.science/api/pith-number/XE3YLMPD7SS764K4IRCHND2BKQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XE3YLMPD7SS764K4IRCHND2BKQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XE3YLMPD7SS764K4IRCHND2BKQ/action/storage_attestation","attest_author":"https://pith.science/pith/XE3YLMPD7SS764K4IRCHND2BKQ/action/author_attestation","sign_citation":"https://pith.science/pith/XE3YLMPD7SS764K4IRCHND2BKQ/action/citation_signature","submit_replication":"https://pith.science/pith/XE3YLMPD7SS764K4IRCHND2BKQ/action/replication_record"}},"created_at":"2026-05-18T01:20:26.544655+00:00","updated_at":"2026-05-18T01:20:26.544655+00:00"}