{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:7A67IRZWX6EI3CS2CCZO2OPWIU","short_pith_number":"pith:7A67IRZW","schema_version":"1.0","canonical_sha256":"f83df44736bf888d8a5a10b2ed39f6453fa36767a30528f8684aa0f08865fce8","source":{"kind":"arxiv","id":"1109.0604","version":2},"attestation_state":"computed","paper":{"title":"Approximate Counting via Correlation Decay in Spin Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"cs.DS","authors_text":"Liang Li, Pinyan Lu, Yitong Yin","submitted_at":"2011-09-03T08:08:17Z","abstract_excerpt":"We give the first deterministic fully polynomial-time approximation scheme (FPTAS) for computing the partition function of a two-state spin system on an arbitrary graph, when the parameters of the system satisfy the uniqueness condition on infinite regular trees. This condition is of physical significance and is believed to be the right boundary between approximable and inapproximable.\n  The FPTAS is based on the correlation decay technique introduced by Bandyopadhyay and Gamarnik [SODA 06] and Weitz [STOC 06]. The classic correlation decay is defined with respect to graph distance. Although t"},"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":"1109.0604","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-03T08:08:17Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"a5a0c5a3968cb2fccde3132edda24ecde14fa9f992f8b1f271a711a44b47dcda","abstract_canon_sha256":"8adab4d3e7a6e3150597ebe6fecdacb6d2e1888b649a9ce77a45f231a4eb44b9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:09:25.031772Z","signature_b64":"9pgAW7uTBPHp1nsnqBebTHjF8MJRn/RI/AwLcFQqBbZbi2n0wn9PdWC2FdXOsva7VAgHMjaMCyuOAu3E3VotDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f83df44736bf888d8a5a10b2ed39f6453fa36767a30528f8684aa0f08865fce8","last_reissued_at":"2026-05-18T04:09:25.031240Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:09:25.031240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate Counting via Correlation Decay in Spin Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"cs.DS","authors_text":"Liang Li, Pinyan Lu, Yitong Yin","submitted_at":"2011-09-03T08:08:17Z","abstract_excerpt":"We give the first deterministic fully polynomial-time approximation scheme (FPTAS) for computing the partition function of a two-state spin system on an arbitrary graph, when the parameters of the system satisfy the uniqueness condition on infinite regular trees. This condition is of physical significance and is believed to be the right boundary between approximable and inapproximable.\n  The FPTAS is based on the correlation decay technique introduced by Bandyopadhyay and Gamarnik [SODA 06] and Weitz [STOC 06]. The classic correlation decay is defined with respect to graph distance. Although t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.0604","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":"1109.0604","created_at":"2026-05-18T04:09:25.031324+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.0604v2","created_at":"2026-05-18T04:09:25.031324+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.0604","created_at":"2026-05-18T04:09:25.031324+00:00"},{"alias_kind":"pith_short_12","alias_value":"7A67IRZWX6EI","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_16","alias_value":"7A67IRZWX6EI3CS2","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_8","alias_value":"7A67IRZW","created_at":"2026-05-18T12:26:22.705136+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/7A67IRZWX6EI3CS2CCZO2OPWIU","json":"https://pith.science/pith/7A67IRZWX6EI3CS2CCZO2OPWIU.json","graph_json":"https://pith.science/api/pith-number/7A67IRZWX6EI3CS2CCZO2OPWIU/graph.json","events_json":"https://pith.science/api/pith-number/7A67IRZWX6EI3CS2CCZO2OPWIU/events.json","paper":"https://pith.science/paper/7A67IRZW"},"agent_actions":{"view_html":"https://pith.science/pith/7A67IRZWX6EI3CS2CCZO2OPWIU","download_json":"https://pith.science/pith/7A67IRZWX6EI3CS2CCZO2OPWIU.json","view_paper":"https://pith.science/paper/7A67IRZW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.0604&json=true","fetch_graph":"https://pith.science/api/pith-number/7A67IRZWX6EI3CS2CCZO2OPWIU/graph.json","fetch_events":"https://pith.science/api/pith-number/7A67IRZWX6EI3CS2CCZO2OPWIU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7A67IRZWX6EI3CS2CCZO2OPWIU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7A67IRZWX6EI3CS2CCZO2OPWIU/action/storage_attestation","attest_author":"https://pith.science/pith/7A67IRZWX6EI3CS2CCZO2OPWIU/action/author_attestation","sign_citation":"https://pith.science/pith/7A67IRZWX6EI3CS2CCZO2OPWIU/action/citation_signature","submit_replication":"https://pith.science/pith/7A67IRZWX6EI3CS2CCZO2OPWIU/action/replication_record"}},"created_at":"2026-05-18T04:09:25.031324+00:00","updated_at":"2026-05-18T04:09:25.031324+00:00"}