{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:35YW7K6FVDWQXJOQUONPTWNGFA","short_pith_number":"pith:35YW7K6F","schema_version":"1.0","canonical_sha256":"df716fabc5a8ed0ba5d0a39af9d9a6281f5991506f6f19628649105315f7944e","source":{"kind":"arxiv","id":"1704.06493","version":2},"attestation_state":"computed","paper":{"title":"The Ising Partition Function: Zeros and Deterministic Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.CC","cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Alistair Sinclair, Jingcheng Liu, Piyush Srivastava","submitted_at":"2017-04-21T11:46:22Z","abstract_excerpt":"We study the problem of approximating the partition function of the ferromagnetic Ising model in graphs and hypergraphs. Our first result is a deterministic approximation scheme (an FPTAS) for the partition function in bounded degree graphs that is valid over the entire range of parameters $\\beta$ (the interaction) and $\\lambda$ (the external field), except for the case $\\vert{\\lambda}\\vert=1$ (the \"zero-field\" case). A randomized algorithm (FPRAS) for all graphs, and all $\\beta,\\lambda$, has long been known. Unlike most other deterministic approximation algorithms for problems in statistical "},"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":"1704.06493","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-21T11:46:22Z","cross_cats_sorted":["cond-mat.stat-mech","cs.CC","cs.DM","math.CO"],"title_canon_sha256":"409b091a138753c78f0264099ac4181d11d31ff1130dc1cdb616eca4e7daa487","abstract_canon_sha256":"41c2577b584432d62938a6152d425299485a899b7ffe25902c8339aea722c89f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:44.613297Z","signature_b64":"9lKq/iajmp7EBBiI5bDmr99Y+TjPmzvcRCaQHjGnK3tWE0Sr5bVfBX4Ngs3kBUHZcPh+cLAaTL1u05uVhLmECw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df716fabc5a8ed0ba5d0a39af9d9a6281f5991506f6f19628649105315f7944e","last_reissued_at":"2026-05-17T23:57:44.612787Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:44.612787Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Ising Partition Function: Zeros and Deterministic Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.CC","cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Alistair Sinclair, Jingcheng Liu, Piyush Srivastava","submitted_at":"2017-04-21T11:46:22Z","abstract_excerpt":"We study the problem of approximating the partition function of the ferromagnetic Ising model in graphs and hypergraphs. Our first result is a deterministic approximation scheme (an FPTAS) for the partition function in bounded degree graphs that is valid over the entire range of parameters $\\beta$ (the interaction) and $\\lambda$ (the external field), except for the case $\\vert{\\lambda}\\vert=1$ (the \"zero-field\" case). A randomized algorithm (FPRAS) for all graphs, and all $\\beta,\\lambda$, has long been known. Unlike most other deterministic approximation algorithms for problems in statistical "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.06493","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":"1704.06493","created_at":"2026-05-17T23:57:44.612873+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.06493v2","created_at":"2026-05-17T23:57:44.612873+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.06493","created_at":"2026-05-17T23:57:44.612873+00:00"},{"alias_kind":"pith_short_12","alias_value":"35YW7K6FVDWQ","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"35YW7K6FVDWQXJOQ","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"35YW7K6F","created_at":"2026-05-18T12:30:58.224056+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/35YW7K6FVDWQXJOQUONPTWNGFA","json":"https://pith.science/pith/35YW7K6FVDWQXJOQUONPTWNGFA.json","graph_json":"https://pith.science/api/pith-number/35YW7K6FVDWQXJOQUONPTWNGFA/graph.json","events_json":"https://pith.science/api/pith-number/35YW7K6FVDWQXJOQUONPTWNGFA/events.json","paper":"https://pith.science/paper/35YW7K6F"},"agent_actions":{"view_html":"https://pith.science/pith/35YW7K6FVDWQXJOQUONPTWNGFA","download_json":"https://pith.science/pith/35YW7K6FVDWQXJOQUONPTWNGFA.json","view_paper":"https://pith.science/paper/35YW7K6F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.06493&json=true","fetch_graph":"https://pith.science/api/pith-number/35YW7K6FVDWQXJOQUONPTWNGFA/graph.json","fetch_events":"https://pith.science/api/pith-number/35YW7K6FVDWQXJOQUONPTWNGFA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/35YW7K6FVDWQXJOQUONPTWNGFA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/35YW7K6FVDWQXJOQUONPTWNGFA/action/storage_attestation","attest_author":"https://pith.science/pith/35YW7K6FVDWQXJOQUONPTWNGFA/action/author_attestation","sign_citation":"https://pith.science/pith/35YW7K6FVDWQXJOQUONPTWNGFA/action/citation_signature","submit_replication":"https://pith.science/pith/35YW7K6FVDWQXJOQUONPTWNGFA/action/replication_record"}},"created_at":"2026-05-17T23:57:44.612873+00:00","updated_at":"2026-05-17T23:57:44.612873+00:00"}