{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:MN3RUETKZ4CVXNX5YERM6W72EQ","short_pith_number":"pith:MN3RUETK","schema_version":"1.0","canonical_sha256":"63771a126acf055bb6fdc122cf5bfa2421f38f41336073cadbce99c9561d8c30","source":{"kind":"arxiv","id":"1203.2226","version":4},"attestation_state":"computed","paper":{"title":"Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP","math.PR"],"primary_cat":"cs.DM","authors_text":"Andreas Galanis, Daniel Stefankovic, Eric Vigoda","submitted_at":"2012-03-10T03:40:09Z","abstract_excerpt":"Recent inapproximability results of Sly (2010), together with an approximation algorithm presented by Weitz (2006) establish a beautiful picture for the computational complexity of approximating the partition function of the hard-core model. Let $\\lambda_c(T_\\Delta)$ denote the critical activity for the hard-model on the infinite $\\Delta$-regular tree. Weitz presented an FPTAS for the partition function when $\\lambda<\\lambda_c(T_\\Delta)$ for graphs with constant maximum degree $\\Delta$. In contrast, Sly showed that for all $\\Delta\\geq 3$, there exists $\\epsilon_\\Delta>0$ such that (unless RP=N"},"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":"1203.2226","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-03-10T03:40:09Z","cross_cats_sorted":["math-ph","math.MP","math.PR"],"title_canon_sha256":"ce7d190158739da04d433e6876b1470a774ecbeb49dbe0e31880aa05e3d7631a","abstract_canon_sha256":"e2bf718a9cd20bb179e7c1e94dbbdc4fc343db9571f35fa976a06f6e23c653ee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:46.184349Z","signature_b64":"msHwuohapKQgIgexRSGyWdhyFYn8S6HIRL83V/+oK+EZJ53xOjlUivmoYcZSPklAawONVbJSZRvvbdIM93VXBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63771a126acf055bb6fdc122cf5bfa2421f38f41336073cadbce99c9561d8c30","last_reissued_at":"2026-05-18T01:04:46.183948Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:46.183948Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP","math.PR"],"primary_cat":"cs.DM","authors_text":"Andreas Galanis, Daniel Stefankovic, Eric Vigoda","submitted_at":"2012-03-10T03:40:09Z","abstract_excerpt":"Recent inapproximability results of Sly (2010), together with an approximation algorithm presented by Weitz (2006) establish a beautiful picture for the computational complexity of approximating the partition function of the hard-core model. Let $\\lambda_c(T_\\Delta)$ denote the critical activity for the hard-model on the infinite $\\Delta$-regular tree. Weitz presented an FPTAS for the partition function when $\\lambda<\\lambda_c(T_\\Delta)$ for graphs with constant maximum degree $\\Delta$. In contrast, Sly showed that for all $\\Delta\\geq 3$, there exists $\\epsilon_\\Delta>0$ such that (unless RP=N"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.2226","kind":"arxiv","version":4},"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":"1203.2226","created_at":"2026-05-18T01:04:46.184002+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.2226v4","created_at":"2026-05-18T01:04:46.184002+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.2226","created_at":"2026-05-18T01:04:46.184002+00:00"},{"alias_kind":"pith_short_12","alias_value":"MN3RUETKZ4CV","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"MN3RUETKZ4CVXNX5","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"MN3RUETK","created_at":"2026-05-18T12:27:14.488303+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/MN3RUETKZ4CVXNX5YERM6W72EQ","json":"https://pith.science/pith/MN3RUETKZ4CVXNX5YERM6W72EQ.json","graph_json":"https://pith.science/api/pith-number/MN3RUETKZ4CVXNX5YERM6W72EQ/graph.json","events_json":"https://pith.science/api/pith-number/MN3RUETKZ4CVXNX5YERM6W72EQ/events.json","paper":"https://pith.science/paper/MN3RUETK"},"agent_actions":{"view_html":"https://pith.science/pith/MN3RUETKZ4CVXNX5YERM6W72EQ","download_json":"https://pith.science/pith/MN3RUETKZ4CVXNX5YERM6W72EQ.json","view_paper":"https://pith.science/paper/MN3RUETK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.2226&json=true","fetch_graph":"https://pith.science/api/pith-number/MN3RUETKZ4CVXNX5YERM6W72EQ/graph.json","fetch_events":"https://pith.science/api/pith-number/MN3RUETKZ4CVXNX5YERM6W72EQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MN3RUETKZ4CVXNX5YERM6W72EQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MN3RUETKZ4CVXNX5YERM6W72EQ/action/storage_attestation","attest_author":"https://pith.science/pith/MN3RUETKZ4CVXNX5YERM6W72EQ/action/author_attestation","sign_citation":"https://pith.science/pith/MN3RUETKZ4CVXNX5YERM6W72EQ/action/citation_signature","submit_replication":"https://pith.science/pith/MN3RUETKZ4CVXNX5YERM6W72EQ/action/replication_record"}},"created_at":"2026-05-18T01:04:46.184002+00:00","updated_at":"2026-05-18T01:04:46.184002+00:00"}