{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:QOFXSWF2XJU34ITHJMK3ROMRF6","short_pith_number":"pith:QOFXSWF2","canonical_record":{"source":{"id":"1310.2252","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2013-10-08T20:01:04Z","cross_cats_sorted":[],"title_canon_sha256":"1e3619be9476385f8aeca347a6843304e97ead73c8e782cffd06ac8621b9b4a2","abstract_canon_sha256":"81b3b8eaabc19aa4e787761370a1317ab496f796706d664ee2bfa41829d2026e"},"schema_version":"1.0"},"canonical_sha256":"838b7958baba69be22674b15b8b9912f97cae7b8a3e30dadfdd40d115d58ac1f","source":{"kind":"arxiv","id":"1310.2252","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.2252","created_at":"2026-05-18T03:10:57Z"},{"alias_kind":"arxiv_version","alias_value":"1310.2252v1","created_at":"2026-05-18T03:10:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2252","created_at":"2026-05-18T03:10:57Z"},{"alias_kind":"pith_short_12","alias_value":"QOFXSWF2XJU3","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QOFXSWF2XJU34ITH","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QOFXSWF2","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:QOFXSWF2XJU34ITHJMK3ROMRF6","target":"record","payload":{"canonical_record":{"source":{"id":"1310.2252","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2013-10-08T20:01:04Z","cross_cats_sorted":[],"title_canon_sha256":"1e3619be9476385f8aeca347a6843304e97ead73c8e782cffd06ac8621b9b4a2","abstract_canon_sha256":"81b3b8eaabc19aa4e787761370a1317ab496f796706d664ee2bfa41829d2026e"},"schema_version":"1.0"},"canonical_sha256":"838b7958baba69be22674b15b8b9912f97cae7b8a3e30dadfdd40d115d58ac1f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:57.503794Z","signature_b64":"Wj+Llml7VKqP1x5Oxc3SwIh9vJXa4r+R+P0iJpIqwtsrurvSqlmThQoFyM4DECvoN3O8fvaxMgYZcPLb9G2vCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"838b7958baba69be22674b15b8b9912f97cae7b8a3e30dadfdd40d115d58ac1f","last_reissued_at":"2026-05-18T03:10:57.503010Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:57.503010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.2252","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-18T03:10:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ckJ//T8lJ77qhr+Uvat9t+pRa78ScIkUjWhUfto5oh+i2flds0984Dt9AREuI55wrRJLd+TU0TbVLpSZ4A8TAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T12:53:41.253888Z"},"content_sha256":"5bee0ed9d7b905366b328cf22208060d0989b3f1e46330061bafd6d7a36976ce","schema_version":"1.0","event_id":"sha256:5bee0ed9d7b905366b328cf22208060d0989b3f1e46330061bafd6d7a36976ce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:QOFXSWF2XJU34ITHJMK3ROMRF6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Kramers-Wannier Duality of Statistical Mechanics Applied to the Boolean Satisfiability Problem of Computer Science","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cond-mat.stat-mech","authors_text":"Benjamin Hsu, Joe Mitchell, Victor Galitski","submitted_at":"2013-10-08T20:01:04Z","abstract_excerpt":"We present a novel application of the Kramers-Wannier duality on one of the most important problems of computer science, the Boolean satisfiability problem (SAT). More specifically, we focus on sharp-SAT or equivalently #SAT - the problem of counting the number of solutions to a Boolean satisfaction formula. #SAT can be cast into a statistical-mechanical language, where it reduces to calculating the partition function of an Ising spin Hamiltonian with multi-spin interactions. We show that Kramers-Wannier duality can be generalized to apply to such multi-connected spin networks. We present an e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.2252","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-18T03:10:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gBjSGNhB83JQ7HrtIEW2b7yWdQ5Aur2vd5V8X/tL20bnGOW7CNI6Ai5RNbcxOcSgemr98sXjMYPqJiUFaZDPDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T12:53:41.254253Z"},"content_sha256":"317834c6811f684fab54d319fa9efe2fdc45f0cee75f4184f5bd3f6eca2518b7","schema_version":"1.0","event_id":"sha256:317834c6811f684fab54d319fa9efe2fdc45f0cee75f4184f5bd3f6eca2518b7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QOFXSWF2XJU34ITHJMK3ROMRF6/bundle.json","state_url":"https://pith.science/pith/QOFXSWF2XJU34ITHJMK3ROMRF6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QOFXSWF2XJU34ITHJMK3ROMRF6/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-19T12:53:41Z","links":{"resolver":"https://pith.science/pith/QOFXSWF2XJU34ITHJMK3ROMRF6","bundle":"https://pith.science/pith/QOFXSWF2XJU34ITHJMK3ROMRF6/bundle.json","state":"https://pith.science/pith/QOFXSWF2XJU34ITHJMK3ROMRF6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QOFXSWF2XJU34ITHJMK3ROMRF6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:QOFXSWF2XJU34ITHJMK3ROMRF6","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":"81b3b8eaabc19aa4e787761370a1317ab496f796706d664ee2bfa41829d2026e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2013-10-08T20:01:04Z","title_canon_sha256":"1e3619be9476385f8aeca347a6843304e97ead73c8e782cffd06ac8621b9b4a2"},"schema_version":"1.0","source":{"id":"1310.2252","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.2252","created_at":"2026-05-18T03:10:57Z"},{"alias_kind":"arxiv_version","alias_value":"1310.2252v1","created_at":"2026-05-18T03:10:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2252","created_at":"2026-05-18T03:10:57Z"},{"alias_kind":"pith_short_12","alias_value":"QOFXSWF2XJU3","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QOFXSWF2XJU34ITH","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QOFXSWF2","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:317834c6811f684fab54d319fa9efe2fdc45f0cee75f4184f5bd3f6eca2518b7","target":"graph","created_at":"2026-05-18T03:10:57Z","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 a novel application of the Kramers-Wannier duality on one of the most important problems of computer science, the Boolean satisfiability problem (SAT). More specifically, we focus on sharp-SAT or equivalently #SAT - the problem of counting the number of solutions to a Boolean satisfaction formula. #SAT can be cast into a statistical-mechanical language, where it reduces to calculating the partition function of an Ising spin Hamiltonian with multi-spin interactions. We show that Kramers-Wannier duality can be generalized to apply to such multi-connected spin networks. We present an e","authors_text":"Benjamin Hsu, Joe Mitchell, Victor Galitski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2013-10-08T20:01:04Z","title":"Kramers-Wannier Duality of Statistical Mechanics Applied to the Boolean Satisfiability Problem of Computer Science"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.2252","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:5bee0ed9d7b905366b328cf22208060d0989b3f1e46330061bafd6d7a36976ce","target":"record","created_at":"2026-05-18T03:10:57Z","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":"81b3b8eaabc19aa4e787761370a1317ab496f796706d664ee2bfa41829d2026e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2013-10-08T20:01:04Z","title_canon_sha256":"1e3619be9476385f8aeca347a6843304e97ead73c8e782cffd06ac8621b9b4a2"},"schema_version":"1.0","source":{"id":"1310.2252","kind":"arxiv","version":1}},"canonical_sha256":"838b7958baba69be22674b15b8b9912f97cae7b8a3e30dadfdd40d115d58ac1f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"838b7958baba69be22674b15b8b9912f97cae7b8a3e30dadfdd40d115d58ac1f","first_computed_at":"2026-05-18T03:10:57.503010Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:10:57.503010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Wj+Llml7VKqP1x5Oxc3SwIh9vJXa4r+R+P0iJpIqwtsrurvSqlmThQoFyM4DECvoN3O8fvaxMgYZcPLb9G2vCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:10:57.503794Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.2252","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5bee0ed9d7b905366b328cf22208060d0989b3f1e46330061bafd6d7a36976ce","sha256:317834c6811f684fab54d319fa9efe2fdc45f0cee75f4184f5bd3f6eca2518b7"],"state_sha256":"d9edf7f2fbb7c573042a3817864c3a700a7129fc7dcd4496b3c11e40c09f9591"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3XTP9pwxRd8IdUV+PLg5puhr40C1bdV/L6qseTapxlSG/nCdWl4uUc1kJ5AxQfKq/TMhvNu8uqF6L9Qfz7tSAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T12:53:41.255990Z","bundle_sha256":"05a3d3f3a34b086d766c74fac9e531ca06c8cba47f17dec54b77d8b1e7a4296b"}}