{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:4IHDYFQ7RYV2TYKOJH45IQP6A5","short_pith_number":"pith:4IHDYFQ7","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"},"canonical_sha256":"e20e3c161f8e2ba9e14e49f9d441fe075717eb136e8bd5b19e6ea442cd9650bf","source":{"kind":"arxiv","id":"1906.06431","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.06431","created_at":"2026-05-17T23:43:13Z"},{"alias_kind":"arxiv_version","alias_value":"1906.06431v1","created_at":"2026-05-17T23:43:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.06431","created_at":"2026-05-17T23:43:13Z"},{"alias_kind":"pith_short_12","alias_value":"4IHDYFQ7RYV2","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4IHDYFQ7RYV2TYKO","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4IHDYFQ7","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:4IHDYFQ7RYV2TYKOJH45IQP6A5","target":"record","payload":{"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"},"canonical_sha256":"e20e3c161f8e2ba9e14e49f9d441fe075717eb136e8bd5b19e6ea442cd9650bf","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"},"source_kind":"arxiv","source_id":"1906.06431","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:43:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"38zOFou5SfINJnrWgJLDhBHbr+ey6h6BGUNFdfxLkz9G4FsBcduf/5H/VqhzK7HlzUiBiaPtd2p83bCKYPZFCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T15:12:49.839406Z"},"content_sha256":"3664ed05ef26c24d4622360ced13ad5d3fda877e5c1b8537ba9d491a7f56b73f","schema_version":"1.0","event_id":"sha256:3664ed05ef26c24d4622360ced13ad5d3fda877e5c1b8537ba9d491a7f56b73f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:4IHDYFQ7RYV2TYKOJH45IQP6A5","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:43:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tZmXHWrDwGP38wtcmYeqv/g/vfRMzsl/diq0tw+e6HQUAOc0oNPc4aqWVaI/fhtnSD+bQiqNHWCAN1y3Pb68Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T15:12:49.839767Z"},"content_sha256":"0c639e332d666b3b18a2b73fd15df9d125f724b0d02045b9d41dd85c39387c7b","schema_version":"1.0","event_id":"sha256:0c639e332d666b3b18a2b73fd15df9d125f724b0d02045b9d41dd85c39387c7b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4IHDYFQ7RYV2TYKOJH45IQP6A5/bundle.json","state_url":"https://pith.science/pith/4IHDYFQ7RYV2TYKOJH45IQP6A5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4IHDYFQ7RYV2TYKOJH45IQP6A5/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-03T15:12:49Z","links":{"resolver":"https://pith.science/pith/4IHDYFQ7RYV2TYKOJH45IQP6A5","bundle":"https://pith.science/pith/4IHDYFQ7RYV2TYKOJH45IQP6A5/bundle.json","state":"https://pith.science/pith/4IHDYFQ7RYV2TYKOJH45IQP6A5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4IHDYFQ7RYV2TYKOJH45IQP6A5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:4IHDYFQ7RYV2TYKOJH45IQP6A5","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"fa9b7eb33f26a2444a85e2cdd9c419332f86552efafdc443d9e61b118c9ee61d","cross_cats_sorted":["cond-mat.stat-mech","physics.data-an","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-14T23:15:35Z","title_canon_sha256":"10687d16a20586d8bef3102ec13326cc8264640a03ac139bfe7795a680c6ddfa"},"schema_version":"1.0","source":{"id":"1906.06431","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.06431","created_at":"2026-05-17T23:43:13Z"},{"alias_kind":"arxiv_version","alias_value":"1906.06431v1","created_at":"2026-05-17T23:43:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.06431","created_at":"2026-05-17T23:43:13Z"},{"alias_kind":"pith_short_12","alias_value":"4IHDYFQ7RYV2","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4IHDYFQ7RYV2TYKO","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4IHDYFQ7","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:0c639e332d666b3b18a2b73fd15df9d125f724b0d02045b9d41dd85c39387c7b","target":"graph","created_at":"2026-05-17T23:43:13Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Michael Chertkov, Valerii Likhosherstov, Yury Maximov","cross_cats":["cond-mat.stat-mech","physics.data-an","stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-14T23:15:35Z","title":"A New Family of Tractable Ising Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.06431","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3664ed05ef26c24d4622360ced13ad5d3fda877e5c1b8537ba9d491a7f56b73f","target":"record","created_at":"2026-05-17T23:43:13Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"fa9b7eb33f26a2444a85e2cdd9c419332f86552efafdc443d9e61b118c9ee61d","cross_cats_sorted":["cond-mat.stat-mech","physics.data-an","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-14T23:15:35Z","title_canon_sha256":"10687d16a20586d8bef3102ec13326cc8264640a03ac139bfe7795a680c6ddfa"},"schema_version":"1.0","source":{"id":"1906.06431","kind":"arxiv","version":1}},"canonical_sha256":"e20e3c161f8e2ba9e14e49f9d441fe075717eb136e8bd5b19e6ea442cd9650bf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e20e3c161f8e2ba9e14e49f9d441fe075717eb136e8bd5b19e6ea442cd9650bf","first_computed_at":"2026-05-17T23:43:13.717299Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:13.717299Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WDKYG9UBUBrsEzdiv4p2mBHxjo1Kj6jG9lUhkQCKgYMUstZmYqGAcL5g7KwCQiOlEdmB52Zs7V3zKPGv3yeMAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:13.717935Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.06431","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3664ed05ef26c24d4622360ced13ad5d3fda877e5c1b8537ba9d491a7f56b73f","sha256:0c639e332d666b3b18a2b73fd15df9d125f724b0d02045b9d41dd85c39387c7b"],"state_sha256":"2d8174c35acf8f34aeb6ec5aa595a31ee56bd8837cee59aaed21ee21e0558ef3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k+mXtxLrVisXt/weGdiJTVdG+1oNfohGNFS1Or3jJL42VpkJm+M2eikoASsloZC3txnSyL1gDlmOPNQLRZGQCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T15:12:49.843027Z","bundle_sha256":"de45db893004f8d51724ab3d6c383c3d346641354e59b2faf8b3520d12f16f0c"}}