{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:4IHDYFQ7RYV2TYKOJH45IQP6A5","short_pith_number":"pith:4IHDYFQ7","schema_version":"1.0","canonical_sha256":"e20e3c161f8e2ba9e14e49f9d441fe075717eb136e8bd5b19e6ea442cd9650bf","source":{"kind":"arxiv","id":"1906.06431","version":1},"attestation_state":"computed","paper":{"title":"A New Family of Tractable Ising Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","physics.data-an","stat.CO"],"primary_cat":"cs.DS","authors_text":"Michael Chertkov, Valerii Likhosherstov, Yury Maximov","submitted_at":"2019-06-14T23:15:35Z","abstract_excerpt":"We present a new family of zero-field Ising models over N binary variables/spins obtained by consecutive \"gluing\" of planar and $O(1)$-sized components along with subsets of at most three vertices into a tree. The polynomial time algorithm of the dynamic programming type for solving exact inference (partition function computation) and sampling consists of a sequential application of an efficient (for planar) or brute-force (for $O(1)$-sized) inference and sampling to the components as a black box. To illustrate the utility of the new family of tractable graphical models, we first build an $O(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":"1906.06431","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-14T23:15:35Z","cross_cats_sorted":["cond-mat.stat-mech","physics.data-an","stat.CO"],"title_canon_sha256":"10687d16a20586d8bef3102ec13326cc8264640a03ac139bfe7795a680c6ddfa","abstract_canon_sha256":"fa9b7eb33f26a2444a85e2cdd9c419332f86552efafdc443d9e61b118c9ee61d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:13.717935Z","signature_b64":"WDKYG9UBUBrsEzdiv4p2mBHxjo1Kj6jG9lUhkQCKgYMUstZmYqGAcL5g7KwCQiOlEdmB52Zs7V3zKPGv3yeMAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e20e3c161f8e2ba9e14e49f9d441fe075717eb136e8bd5b19e6ea442cd9650bf","last_reissued_at":"2026-05-17T23:43:13.717299Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:13.717299Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A New Family of Tractable Ising Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","physics.data-an","stat.CO"],"primary_cat":"cs.DS","authors_text":"Michael Chertkov, Valerii Likhosherstov, Yury Maximov","submitted_at":"2019-06-14T23:15:35Z","abstract_excerpt":"We present a new family of zero-field Ising models over N binary variables/spins obtained by consecutive \"gluing\" of planar and $O(1)$-sized components along with subsets of at most three vertices into a tree. The polynomial time algorithm of the dynamic programming type for solving exact inference (partition function computation) and sampling consists of a sequential application of an efficient (for planar) or brute-force (for $O(1)$-sized) inference and sampling to the components as a black box. To illustrate the utility of the new family of tractable graphical models, we first build an $O(N"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.06431","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":"1906.06431","created_at":"2026-05-17T23:43:13.717420+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.06431v1","created_at":"2026-05-17T23:43:13.717420+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.06431","created_at":"2026-05-17T23:43:13.717420+00:00"},{"alias_kind":"pith_short_12","alias_value":"4IHDYFQ7RYV2","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"4IHDYFQ7RYV2TYKO","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"4IHDYFQ7","created_at":"2026-05-18T12:33:10.108867+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/4IHDYFQ7RYV2TYKOJH45IQP6A5","json":"https://pith.science/pith/4IHDYFQ7RYV2TYKOJH45IQP6A5.json","graph_json":"https://pith.science/api/pith-number/4IHDYFQ7RYV2TYKOJH45IQP6A5/graph.json","events_json":"https://pith.science/api/pith-number/4IHDYFQ7RYV2TYKOJH45IQP6A5/events.json","paper":"https://pith.science/paper/4IHDYFQ7"},"agent_actions":{"view_html":"https://pith.science/pith/4IHDYFQ7RYV2TYKOJH45IQP6A5","download_json":"https://pith.science/pith/4IHDYFQ7RYV2TYKOJH45IQP6A5.json","view_paper":"https://pith.science/paper/4IHDYFQ7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.06431&json=true","fetch_graph":"https://pith.science/api/pith-number/4IHDYFQ7RYV2TYKOJH45IQP6A5/graph.json","fetch_events":"https://pith.science/api/pith-number/4IHDYFQ7RYV2TYKOJH45IQP6A5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4IHDYFQ7RYV2TYKOJH45IQP6A5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4IHDYFQ7RYV2TYKOJH45IQP6A5/action/storage_attestation","attest_author":"https://pith.science/pith/4IHDYFQ7RYV2TYKOJH45IQP6A5/action/author_attestation","sign_citation":"https://pith.science/pith/4IHDYFQ7RYV2TYKOJH45IQP6A5/action/citation_signature","submit_replication":"https://pith.science/pith/4IHDYFQ7RYV2TYKOJH45IQP6A5/action/replication_record"}},"created_at":"2026-05-17T23:43:13.717420+00:00","updated_at":"2026-05-17T23:43:13.717420+00:00"}