{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:XE3YLMPD7SS764K4IRCHND2BKQ","short_pith_number":"pith:XE3YLMPD","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"},"canonical_sha256":"b93785b1e3fca5ff715c4444768f415426fb86564d63dcf7c691f4a0ab25c02f","source":{"kind":"arxiv","id":"1405.7375","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.7375","created_at":"2026-05-18T01:20:26Z"},{"alias_kind":"arxiv_version","alias_value":"1405.7375v2","created_at":"2026-05-18T01:20:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.7375","created_at":"2026-05-18T01:20:26Z"},{"alias_kind":"pith_short_12","alias_value":"XE3YLMPD7SS7","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XE3YLMPD7SS764K4","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XE3YLMPD","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:XE3YLMPD7SS764K4IRCHND2BKQ","target":"record","payload":{"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"},"canonical_sha256":"b93785b1e3fca5ff715c4444768f415426fb86564d63dcf7c691f4a0ab25c02f","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"},"source_kind":"arxiv","source_id":"1405.7375","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:20:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NOows9H67lecsjjvBHXbFmJuUqfAPl37B+94DI7a/eSl2BHaTdgXuG/XfffBEYHsJqCX1S3RNmAb77oSwbvLCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:31:45.030586Z"},"content_sha256":"f7b89ee21fc40df2ce6797bf0f602392a3f5c67241c5679ea4421b5c7ff2ad5b","schema_version":"1.0","event_id":"sha256:f7b89ee21fc40df2ce6797bf0f602392a3f5c67241c5679ea4421b5c7ff2ad5b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:XE3YLMPD7SS764K4IRCHND2BKQ","target":"graph","payload":{"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"},"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:20:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"62B2noiEvoivn7YaZYcB3004qHeax6WlfCJSlO1vo9yh/dhjaK49GWP7wzLE406qCxuozb7m5P+wVIBFRVPACA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:31:45.031075Z"},"content_sha256":"6281e04d06a363f98109a3ade4727f12064dfc4baf0ca95c186880aed8c3ad51","schema_version":"1.0","event_id":"sha256:6281e04d06a363f98109a3ade4727f12064dfc4baf0ca95c186880aed8c3ad51"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XE3YLMPD7SS764K4IRCHND2BKQ/bundle.json","state_url":"https://pith.science/pith/XE3YLMPD7SS764K4IRCHND2BKQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XE3YLMPD7SS764K4IRCHND2BKQ/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-30T06:31:45Z","links":{"resolver":"https://pith.science/pith/XE3YLMPD7SS764K4IRCHND2BKQ","bundle":"https://pith.science/pith/XE3YLMPD7SS764K4IRCHND2BKQ/bundle.json","state":"https://pith.science/pith/XE3YLMPD7SS764K4IRCHND2BKQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XE3YLMPD7SS764K4IRCHND2BKQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:XE3YLMPD7SS764K4IRCHND2BKQ","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":"d5faaa873fb4e0c45ee9a677b7de4877351789170408fd3ffa1fd4fb3542bacc","cross_cats_sorted":["cs.CC","cs.LO","math-ph","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-05-28T20:00:25Z","title_canon_sha256":"24aced7786efb14bc4267185de4c5991eec2cc27014186a43ec4de652bf3a0be"},"schema_version":"1.0","source":{"id":"1405.7375","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.7375","created_at":"2026-05-18T01:20:26Z"},{"alias_kind":"arxiv_version","alias_value":"1405.7375v2","created_at":"2026-05-18T01:20:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.7375","created_at":"2026-05-18T01:20:26Z"},{"alias_kind":"pith_short_12","alias_value":"XE3YLMPD7SS7","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XE3YLMPD7SS764K4","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XE3YLMPD","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:6281e04d06a363f98109a3ade4727f12064dfc4baf0ca95c186880aed8c3ad51","target":"graph","created_at":"2026-05-18T01:20:26Z","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 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","authors_text":"Jacob D. Biamonte, Jacob W. Turner, Jason Morton","cross_cats":["cs.CC","cs.LO","math-ph","math.MP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-05-28T20:00:25Z","title":"Tensor Network Contractions for #SAT"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.7375","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:f7b89ee21fc40df2ce6797bf0f602392a3f5c67241c5679ea4421b5c7ff2ad5b","target":"record","created_at":"2026-05-18T01:20:26Z","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":"d5faaa873fb4e0c45ee9a677b7de4877351789170408fd3ffa1fd4fb3542bacc","cross_cats_sorted":["cs.CC","cs.LO","math-ph","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-05-28T20:00:25Z","title_canon_sha256":"24aced7786efb14bc4267185de4c5991eec2cc27014186a43ec4de652bf3a0be"},"schema_version":"1.0","source":{"id":"1405.7375","kind":"arxiv","version":2}},"canonical_sha256":"b93785b1e3fca5ff715c4444768f415426fb86564d63dcf7c691f4a0ab25c02f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b93785b1e3fca5ff715c4444768f415426fb86564d63dcf7c691f4a0ab25c02f","first_computed_at":"2026-05-18T01:20:26.544533Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:26.544533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gmoeOAEEey2jHGjREwX5MxUcCiW3+C6IuHu6q7DVYyvH4o+dvFjkqeYzEYtxgZFT/JZmqRJqj9S7BizR4asrBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:26.545103Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.7375","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f7b89ee21fc40df2ce6797bf0f602392a3f5c67241c5679ea4421b5c7ff2ad5b","sha256:6281e04d06a363f98109a3ade4727f12064dfc4baf0ca95c186880aed8c3ad51"],"state_sha256":"79733a9aa4e34ed9afeb58034836b50de35e69fc9ed77be3cbad02219a543cbc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3r1KkUHRpIVV5OYRDaYZoXwgU9r/LAGaoYyPBaBjUUMTaaXs4VxjRf7nM6hzqRg3xPwyXlruJup2o+46Hdb8Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T06:31:45.033753Z","bundle_sha256":"720d9be2510c575991df6d9f48a5606f33a082ea87d820e7a4b1d64a924becc0"}}