{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:CLUXH6DUU2YC26YZRJONPVATJS","short_pith_number":"pith:CLUXH6DU","schema_version":"1.0","canonical_sha256":"12e973f874a6b02d7b198a5cd7d4134caa107cd4d545b0337ee7b8b2f617e50f","source":{"kind":"arxiv","id":"1107.2368","version":3},"attestation_state":"computed","paper":{"title":"Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.DM","authors_text":"Alistair Sinclair, Marc Thurley, Piyush Srivastava","submitted_at":"2011-07-12T18:42:51Z","abstract_excerpt":"In a seminal paper (Weitz, 2006), Weitz gave a deterministic fully polynomial approximation scheme for count- ing exponentially weighted independent sets (equivalently, approximating the partition function of the hard-core model from statistical physics) on graphs of degree at most d, up to the critical activity for the uniqueness of the Gibbs measure on the infinite d-regular tree. More recently Sly (Sly, 2010) showed that this is optimal in the sense that if there is an FPRAS for the hard-core partition function on graphs of maximum degree d for activities larger than the critical activity o"},"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":"1107.2368","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-07-12T18:42:51Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"f6de36cae5660ad94f609a2d9fe539cda55e0652fd6d4647d0d5318596d920c3","abstract_canon_sha256":"931db8187b477d5566a483a3c9bdff5b4a35697b5bdfa1a52af4290eb74b2d78"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:42.905616Z","signature_b64":"wjDitqMfogJihQTSaaF0ohlxoZ0JU+WcaIQSgwj7OtRQylzkU+K0kGHIKd5delNP9Q/06nnLUjLXl9rpVWRWAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12e973f874a6b02d7b198a5cd7d4134caa107cd4d545b0337ee7b8b2f617e50f","last_reissued_at":"2026-05-18T02:21:42.905115Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:42.905115Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.DM","authors_text":"Alistair Sinclair, Marc Thurley, Piyush Srivastava","submitted_at":"2011-07-12T18:42:51Z","abstract_excerpt":"In a seminal paper (Weitz, 2006), Weitz gave a deterministic fully polynomial approximation scheme for count- ing exponentially weighted independent sets (equivalently, approximating the partition function of the hard-core model from statistical physics) on graphs of degree at most d, up to the critical activity for the uniqueness of the Gibbs measure on the infinite d-regular tree. More recently Sly (Sly, 2010) showed that this is optimal in the sense that if there is an FPRAS for the hard-core partition function on graphs of maximum degree d for activities larger than the critical activity o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.2368","kind":"arxiv","version":3},"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":"1107.2368","created_at":"2026-05-18T02:21:42.905179+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.2368v3","created_at":"2026-05-18T02:21:42.905179+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2368","created_at":"2026-05-18T02:21:42.905179+00:00"},{"alias_kind":"pith_short_12","alias_value":"CLUXH6DUU2YC","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"CLUXH6DUU2YC26YZ","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"CLUXH6DU","created_at":"2026-05-18T12:26:26.731475+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/CLUXH6DUU2YC26YZRJONPVATJS","json":"https://pith.science/pith/CLUXH6DUU2YC26YZRJONPVATJS.json","graph_json":"https://pith.science/api/pith-number/CLUXH6DUU2YC26YZRJONPVATJS/graph.json","events_json":"https://pith.science/api/pith-number/CLUXH6DUU2YC26YZRJONPVATJS/events.json","paper":"https://pith.science/paper/CLUXH6DU"},"agent_actions":{"view_html":"https://pith.science/pith/CLUXH6DUU2YC26YZRJONPVATJS","download_json":"https://pith.science/pith/CLUXH6DUU2YC26YZRJONPVATJS.json","view_paper":"https://pith.science/paper/CLUXH6DU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.2368&json=true","fetch_graph":"https://pith.science/api/pith-number/CLUXH6DUU2YC26YZRJONPVATJS/graph.json","fetch_events":"https://pith.science/api/pith-number/CLUXH6DUU2YC26YZRJONPVATJS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CLUXH6DUU2YC26YZRJONPVATJS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CLUXH6DUU2YC26YZRJONPVATJS/action/storage_attestation","attest_author":"https://pith.science/pith/CLUXH6DUU2YC26YZRJONPVATJS/action/author_attestation","sign_citation":"https://pith.science/pith/CLUXH6DUU2YC26YZRJONPVATJS/action/citation_signature","submit_replication":"https://pith.science/pith/CLUXH6DUU2YC26YZRJONPVATJS/action/replication_record"}},"created_at":"2026-05-18T02:21:42.905179+00:00","updated_at":"2026-05-18T02:21:42.905179+00:00"}