{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:DT4XGWNKIKEIO6ALKL5WGKNQ2G","short_pith_number":"pith:DT4XGWNK","schema_version":"1.0","canonical_sha256":"1cf97359aa428887780b52fb6329b0d1a49ba9848527801d11879f3988ba1bfa","source":{"kind":"arxiv","id":"1702.07938","version":2},"attestation_state":"computed","paper":{"title":"Complexity Classification of the Eight-Vertex Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"cs.CC","authors_text":"Jin-Yi Cai, Zhiguo Fu","submitted_at":"2017-02-25T19:07:15Z","abstract_excerpt":"We prove a complexity dichotomy theorem for the eight-vertex model. For every setting of the parameters of the model, we prove that computing the partition function is either solvable in polynomial time or \\#P-hard. The dichotomy criterion is explicit. For tractability, we find some new classes of problems computable in polynomial time. For \\#P-hardness, we employ M\\\"{o}bius transformations to prove the success of interpolations."},"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":"1702.07938","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-02-25T19:07:15Z","cross_cats_sorted":["cond-mat.stat-mech"],"title_canon_sha256":"e9ff383faaa4bc0d9aa3f657a8d4d2386316ba493112cefc87284ac2dd0ceb07","abstract_canon_sha256":"301bb697524065a8e9c8c80af9bf21ba2f4d2bc55bcec199b3bad1f414c3efaa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:36.848444Z","signature_b64":"/AgO0tI2wfFiFoPCC+0nqsoCGgohISAnWK0aC9v9gWfZhWhXV/6PbFty03jH9Qs7x1pT8DMwSuC82eDroqseBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1cf97359aa428887780b52fb6329b0d1a49ba9848527801d11879f3988ba1bfa","last_reissued_at":"2026-05-18T00:47:36.847928Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:36.847928Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity Classification of the Eight-Vertex Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"cs.CC","authors_text":"Jin-Yi Cai, Zhiguo Fu","submitted_at":"2017-02-25T19:07:15Z","abstract_excerpt":"We prove a complexity dichotomy theorem for the eight-vertex model. For every setting of the parameters of the model, we prove that computing the partition function is either solvable in polynomial time or \\#P-hard. The dichotomy criterion is explicit. For tractability, we find some new classes of problems computable in polynomial time. For \\#P-hardness, we employ M\\\"{o}bius transformations to prove the success of interpolations."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07938","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":"1702.07938","created_at":"2026-05-18T00:47:36.848004+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.07938v2","created_at":"2026-05-18T00:47:36.848004+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07938","created_at":"2026-05-18T00:47:36.848004+00:00"},{"alias_kind":"pith_short_12","alias_value":"DT4XGWNKIKEI","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"DT4XGWNKIKEIO6AL","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"DT4XGWNK","created_at":"2026-05-18T12:31:12.930513+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/DT4XGWNKIKEIO6ALKL5WGKNQ2G","json":"https://pith.science/pith/DT4XGWNKIKEIO6ALKL5WGKNQ2G.json","graph_json":"https://pith.science/api/pith-number/DT4XGWNKIKEIO6ALKL5WGKNQ2G/graph.json","events_json":"https://pith.science/api/pith-number/DT4XGWNKIKEIO6ALKL5WGKNQ2G/events.json","paper":"https://pith.science/paper/DT4XGWNK"},"agent_actions":{"view_html":"https://pith.science/pith/DT4XGWNKIKEIO6ALKL5WGKNQ2G","download_json":"https://pith.science/pith/DT4XGWNKIKEIO6ALKL5WGKNQ2G.json","view_paper":"https://pith.science/paper/DT4XGWNK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.07938&json=true","fetch_graph":"https://pith.science/api/pith-number/DT4XGWNKIKEIO6ALKL5WGKNQ2G/graph.json","fetch_events":"https://pith.science/api/pith-number/DT4XGWNKIKEIO6ALKL5WGKNQ2G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DT4XGWNKIKEIO6ALKL5WGKNQ2G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DT4XGWNKIKEIO6ALKL5WGKNQ2G/action/storage_attestation","attest_author":"https://pith.science/pith/DT4XGWNKIKEIO6ALKL5WGKNQ2G/action/author_attestation","sign_citation":"https://pith.science/pith/DT4XGWNKIKEIO6ALKL5WGKNQ2G/action/citation_signature","submit_replication":"https://pith.science/pith/DT4XGWNKIKEIO6ALKL5WGKNQ2G/action/replication_record"}},"created_at":"2026-05-18T00:47:36.848004+00:00","updated_at":"2026-05-18T00:47:36.848004+00:00"}