{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:N3TVABGR6PQNX627U72XKNLIMG","short_pith_number":"pith:N3TVABGR","canonical_record":{"source":{"id":"1311.2128","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-11-09T02:30:29Z","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.stat-mech","cs.CC"],"title_canon_sha256":"5c55e4e0efd8a22959d785d99c47b31f60b66cdce016545fc0fbd0ae705aedd6","abstract_canon_sha256":"00a3af0dc94457f909528013c5d53b0417e25d7eaa27c1cf6dd3ca13ecf6e041"},"schema_version":"1.0"},"canonical_sha256":"6ee75004d1f3e0dbfb5fa7f575356861b8fe9ae5730e4a2eab411b480ee9d15a","source":{"kind":"arxiv","id":"1311.2128","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.2128","created_at":"2026-05-18T00:49:40Z"},{"alias_kind":"arxiv_version","alias_value":"1311.2128v2","created_at":"2026-05-18T00:49:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.2128","created_at":"2026-05-18T00:49:40Z"},{"alias_kind":"pith_short_12","alias_value":"N3TVABGR6PQN","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"N3TVABGR6PQNX627","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"N3TVABGR","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:N3TVABGR6PQNX627U72XKNLIMG","target":"record","payload":{"canonical_record":{"source":{"id":"1311.2128","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-11-09T02:30:29Z","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.stat-mech","cs.CC"],"title_canon_sha256":"5c55e4e0efd8a22959d785d99c47b31f60b66cdce016545fc0fbd0ae705aedd6","abstract_canon_sha256":"00a3af0dc94457f909528013c5d53b0417e25d7eaa27c1cf6dd3ca13ecf6e041"},"schema_version":"1.0"},"canonical_sha256":"6ee75004d1f3e0dbfb5fa7f575356861b8fe9ae5730e4a2eab411b480ee9d15a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:40.449898Z","signature_b64":"0109EVIQ/R1hW47losqyzRje2pDfjM9zQSSyPK5bfWNm78CyQy3/Ka4BegbEoIExwZe1wxt/JGZvzKlPxhBHAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ee75004d1f3e0dbfb5fa7f575356861b8fe9ae5730e4a2eab411b480ee9d15a","last_reissued_at":"2026-05-18T00:49:40.449452Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:40.449452Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.2128","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-18T00:49:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BWGVfjuJKnDD5ZLTZpGZYm/loQxbKu9X7hBF2n78ia9Pl+YhPcDZpf1jLLx/AcWHnAiapeh/a1OJQG9Au1iRAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T05:56:01.669113Z"},"content_sha256":"97a307fed2d67cc89331bf5a693cecfe7c26fb077faa8b5fe719cfd576923121","schema_version":"1.0","event_id":"sha256:97a307fed2d67cc89331bf5a693cecfe7c26fb077faa8b5fe719cfd576923121"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:N3TVABGR6PQNX627U72XKNLIMG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum Commuting Circuits and Complexity of Ising Partition Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cond-mat.stat-mech","cs.CC"],"primary_cat":"quant-ph","authors_text":"Keisuke Fujii, Tomoyuki Morimae","submitted_at":"2013-11-09T02:30:29Z","abstract_excerpt":"Instantaneous quantum polynomial-time (IQP) computation is a class of quantum computation consisting only of commuting two-qubit gates and is not universal in the sense of standard quantum computation. Nevertheless, it has been shown that if there is a classical algorithm that can simulate IQP efficiently, the polynomial hierarchy (PH) collapses at the third level, which is highly implausible. However, the origin of the classical intractability is still less understood. Here we establish a relationship between IQP and computational complexity of the partition functions of Ising models. We appl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.2128","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-18T00:49:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CsRnzqO/n/mtD4jWHusMQNckSDaMy0HeX8mgaioGtjO0jBPnKxwtIROed2cusC52YBvrh3+8W0ty7kuz0WF4AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T05:56:01.669485Z"},"content_sha256":"4200afbbbe5f592cfd5da50db6b03e6eb1887b40ad91ff2bf6334cfec9169719","schema_version":"1.0","event_id":"sha256:4200afbbbe5f592cfd5da50db6b03e6eb1887b40ad91ff2bf6334cfec9169719"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N3TVABGR6PQNX627U72XKNLIMG/bundle.json","state_url":"https://pith.science/pith/N3TVABGR6PQNX627U72XKNLIMG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N3TVABGR6PQNX627U72XKNLIMG/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-28T05:56:01Z","links":{"resolver":"https://pith.science/pith/N3TVABGR6PQNX627U72XKNLIMG","bundle":"https://pith.science/pith/N3TVABGR6PQNX627U72XKNLIMG/bundle.json","state":"https://pith.science/pith/N3TVABGR6PQNX627U72XKNLIMG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N3TVABGR6PQNX627U72XKNLIMG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:N3TVABGR6PQNX627U72XKNLIMG","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":"00a3af0dc94457f909528013c5d53b0417e25d7eaa27c1cf6dd3ca13ecf6e041","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.stat-mech","cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-11-09T02:30:29Z","title_canon_sha256":"5c55e4e0efd8a22959d785d99c47b31f60b66cdce016545fc0fbd0ae705aedd6"},"schema_version":"1.0","source":{"id":"1311.2128","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.2128","created_at":"2026-05-18T00:49:40Z"},{"alias_kind":"arxiv_version","alias_value":"1311.2128v2","created_at":"2026-05-18T00:49:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.2128","created_at":"2026-05-18T00:49:40Z"},{"alias_kind":"pith_short_12","alias_value":"N3TVABGR6PQN","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"N3TVABGR6PQNX627","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"N3TVABGR","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:4200afbbbe5f592cfd5da50db6b03e6eb1887b40ad91ff2bf6334cfec9169719","target":"graph","created_at":"2026-05-18T00:49:40Z","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":"Instantaneous quantum polynomial-time (IQP) computation is a class of quantum computation consisting only of commuting two-qubit gates and is not universal in the sense of standard quantum computation. Nevertheless, it has been shown that if there is a classical algorithm that can simulate IQP efficiently, the polynomial hierarchy (PH) collapses at the third level, which is highly implausible. However, the origin of the classical intractability is still less understood. Here we establish a relationship between IQP and computational complexity of the partition functions of Ising models. We appl","authors_text":"Keisuke Fujii, Tomoyuki Morimae","cross_cats":["cond-mat.dis-nn","cond-mat.stat-mech","cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-11-09T02:30:29Z","title":"Quantum Commuting Circuits and Complexity of Ising Partition Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.2128","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:97a307fed2d67cc89331bf5a693cecfe7c26fb077faa8b5fe719cfd576923121","target":"record","created_at":"2026-05-18T00:49:40Z","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":"00a3af0dc94457f909528013c5d53b0417e25d7eaa27c1cf6dd3ca13ecf6e041","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.stat-mech","cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-11-09T02:30:29Z","title_canon_sha256":"5c55e4e0efd8a22959d785d99c47b31f60b66cdce016545fc0fbd0ae705aedd6"},"schema_version":"1.0","source":{"id":"1311.2128","kind":"arxiv","version":2}},"canonical_sha256":"6ee75004d1f3e0dbfb5fa7f575356861b8fe9ae5730e4a2eab411b480ee9d15a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6ee75004d1f3e0dbfb5fa7f575356861b8fe9ae5730e4a2eab411b480ee9d15a","first_computed_at":"2026-05-18T00:49:40.449452Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:40.449452Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0109EVIQ/R1hW47losqyzRje2pDfjM9zQSSyPK5bfWNm78CyQy3/Ka4BegbEoIExwZe1wxt/JGZvzKlPxhBHAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:40.449898Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.2128","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:97a307fed2d67cc89331bf5a693cecfe7c26fb077faa8b5fe719cfd576923121","sha256:4200afbbbe5f592cfd5da50db6b03e6eb1887b40ad91ff2bf6334cfec9169719"],"state_sha256":"d86c62c4a1ef71f6c6c185a5c4677ffdcd2881ab144d2f39023a75407470f984"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"usoPClrlQWGBoF37zWYZl4TLDM5P4V3KMbA8jnE/5SK8jzNf3I8nkekfPol2qllUtpF+HQSUJRr+HKK1Dhs0CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T05:56:01.671537Z","bundle_sha256":"ed39e40d93a7734d2f832aac130c14c74996f75b3e7aca148a33860484ef3413"}}