{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:UR3FO2R74DEE6K5BCWZIFGEQHK","short_pith_number":"pith:UR3FO2R7","schema_version":"1.0","canonical_sha256":"a476576a3fe0c84f2ba115b28298903aa02c005b530c99b4d2d26f3d67ed81bd","source":{"kind":"arxiv","id":"1203.2602","version":1},"attestation_state":"computed","paper":{"title":"The computational hardness of counting in two-spin models on d-regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math-ph","math.MP"],"primary_cat":"math.PR","authors_text":"Allan Sly, Nike Sun","submitted_at":"2012-03-12T19:53:53Z","abstract_excerpt":"The class of two-spin systems contains several important models, including random independent sets and the Ising model of statistical physics. We show that for both the hard-core (independent set) model and the anti-ferromagnetic Ising model with arbitrary external field, it is NP-hard to approximate the partition function or approximately sample from the model on d-regular graphs when the model has non-uniqueness on the d-regular tree. Together with results of Jerrum--Sinclair, Weitz, and Sinclair--Srivastava--Thurley giving FPRAS's for all other two-spin systems except at the uniqueness thre"},"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.2602","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-03-12T19:53:53Z","cross_cats_sorted":["cs.CC","math-ph","math.MP"],"title_canon_sha256":"bc79740692fe1f5435f163691a062f7ba3749bea115bc33c3026ed616d8cd88a","abstract_canon_sha256":"8c47b3426d87800b946446a028aa8609446582b99539dbc806eff52b868aaffd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:16.388626Z","signature_b64":"2aKcX1kL148NdNtabEG+6eGLdae4OR3t9PvNN5ADk0EBQasY2Hxfl4rh0UeYp98pSojXNhFXXwPPtT57suyYCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a476576a3fe0c84f2ba115b28298903aa02c005b530c99b4d2d26f3d67ed81bd","last_reissued_at":"2026-05-18T04:00:16.387946Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:16.387946Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The computational hardness of counting in two-spin models on d-regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math-ph","math.MP"],"primary_cat":"math.PR","authors_text":"Allan Sly, Nike Sun","submitted_at":"2012-03-12T19:53:53Z","abstract_excerpt":"The class of two-spin systems contains several important models, including random independent sets and the Ising model of statistical physics. We show that for both the hard-core (independent set) model and the anti-ferromagnetic Ising model with arbitrary external field, it is NP-hard to approximate the partition function or approximately sample from the model on d-regular graphs when the model has non-uniqueness on the d-regular tree. Together with results of Jerrum--Sinclair, Weitz, and Sinclair--Srivastava--Thurley giving FPRAS's for all other two-spin systems except at the uniqueness thre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.2602","kind":"arxiv","version":1},"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.2602","created_at":"2026-05-18T04:00:16.388044+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.2602v1","created_at":"2026-05-18T04:00:16.388044+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.2602","created_at":"2026-05-18T04:00:16.388044+00:00"},{"alias_kind":"pith_short_12","alias_value":"UR3FO2R74DEE","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"UR3FO2R74DEE6K5B","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"UR3FO2R7","created_at":"2026-05-18T12:27:23.164592+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/UR3FO2R74DEE6K5BCWZIFGEQHK","json":"https://pith.science/pith/UR3FO2R74DEE6K5BCWZIFGEQHK.json","graph_json":"https://pith.science/api/pith-number/UR3FO2R74DEE6K5BCWZIFGEQHK/graph.json","events_json":"https://pith.science/api/pith-number/UR3FO2R74DEE6K5BCWZIFGEQHK/events.json","paper":"https://pith.science/paper/UR3FO2R7"},"agent_actions":{"view_html":"https://pith.science/pith/UR3FO2R74DEE6K5BCWZIFGEQHK","download_json":"https://pith.science/pith/UR3FO2R74DEE6K5BCWZIFGEQHK.json","view_paper":"https://pith.science/paper/UR3FO2R7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.2602&json=true","fetch_graph":"https://pith.science/api/pith-number/UR3FO2R74DEE6K5BCWZIFGEQHK/graph.json","fetch_events":"https://pith.science/api/pith-number/UR3FO2R74DEE6K5BCWZIFGEQHK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UR3FO2R74DEE6K5BCWZIFGEQHK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UR3FO2R74DEE6K5BCWZIFGEQHK/action/storage_attestation","attest_author":"https://pith.science/pith/UR3FO2R74DEE6K5BCWZIFGEQHK/action/author_attestation","sign_citation":"https://pith.science/pith/UR3FO2R74DEE6K5BCWZIFGEQHK/action/citation_signature","submit_replication":"https://pith.science/pith/UR3FO2R74DEE6K5BCWZIFGEQHK/action/replication_record"}},"created_at":"2026-05-18T04:00:16.388044+00:00","updated_at":"2026-05-18T04:00:16.388044+00:00"}