{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ALR5VTFPMCH5BA7FNGBBHPR4DR","short_pith_number":"pith:ALR5VTFP","schema_version":"1.0","canonical_sha256":"02e3daccaf608fd083e5698213be3c1c7b126b41f7d7c4ea8dee466abffd2c31","source":{"kind":"arxiv","id":"1607.03183","version":1},"attestation_state":"computed","paper":{"title":"How to calculate partition functions using convex programming hierarchies: provable bounds for variational methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Andrej Risteski","submitted_at":"2016-07-11T22:10:04Z","abstract_excerpt":"We consider the problem of approximating partition functions for Ising models. We make use of recent tools in combinatorial optimization: the Sherali-Adams and Lasserre convex programming hierarchies, in combination with variational methods to get algorithms for calculating partition functions in these families. These techniques give new, non-trivial approximation guarantees for the partition function beyond the regime of correlation decay. They also generalize some classical results from statistical physics about the Curie-Weiss ferromagnetic Ising model, as well as provide a partition functi"},"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":"1607.03183","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-07-11T22:10:04Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"8072720407490fddd65b6c34a431188a6feb8e808ecf136e1a54dc21c8c6474e","abstract_canon_sha256":"001730956eb22fbd11e4698cec0f1d2d722cef56e9ed9d093e85fb809792ea87"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:09.616681Z","signature_b64":"faB3JIcjk3XrdL5DiKhkprVXgcpRve3JZ2th8ABDWOXYZqgHH+eOAo3IYak97JbehekFkWna4RY+6Traz/ntBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02e3daccaf608fd083e5698213be3c1c7b126b41f7d7c4ea8dee466abffd2c31","last_reissued_at":"2026-05-18T01:11:09.616066Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:09.616066Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How to calculate partition functions using convex programming hierarchies: provable bounds for variational methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Andrej Risteski","submitted_at":"2016-07-11T22:10:04Z","abstract_excerpt":"We consider the problem of approximating partition functions for Ising models. We make use of recent tools in combinatorial optimization: the Sherali-Adams and Lasserre convex programming hierarchies, in combination with variational methods to get algorithms for calculating partition functions in these families. These techniques give new, non-trivial approximation guarantees for the partition function beyond the regime of correlation decay. They also generalize some classical results from statistical physics about the Curie-Weiss ferromagnetic Ising model, as well as provide a partition functi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.03183","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":"1607.03183","created_at":"2026-05-18T01:11:09.616162+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.03183v1","created_at":"2026-05-18T01:11:09.616162+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.03183","created_at":"2026-05-18T01:11:09.616162+00:00"},{"alias_kind":"pith_short_12","alias_value":"ALR5VTFPMCH5","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"ALR5VTFPMCH5BA7F","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"ALR5VTFP","created_at":"2026-05-18T12:30:07.202191+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/ALR5VTFPMCH5BA7FNGBBHPR4DR","json":"https://pith.science/pith/ALR5VTFPMCH5BA7FNGBBHPR4DR.json","graph_json":"https://pith.science/api/pith-number/ALR5VTFPMCH5BA7FNGBBHPR4DR/graph.json","events_json":"https://pith.science/api/pith-number/ALR5VTFPMCH5BA7FNGBBHPR4DR/events.json","paper":"https://pith.science/paper/ALR5VTFP"},"agent_actions":{"view_html":"https://pith.science/pith/ALR5VTFPMCH5BA7FNGBBHPR4DR","download_json":"https://pith.science/pith/ALR5VTFPMCH5BA7FNGBBHPR4DR.json","view_paper":"https://pith.science/paper/ALR5VTFP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.03183&json=true","fetch_graph":"https://pith.science/api/pith-number/ALR5VTFPMCH5BA7FNGBBHPR4DR/graph.json","fetch_events":"https://pith.science/api/pith-number/ALR5VTFPMCH5BA7FNGBBHPR4DR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ALR5VTFPMCH5BA7FNGBBHPR4DR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ALR5VTFPMCH5BA7FNGBBHPR4DR/action/storage_attestation","attest_author":"https://pith.science/pith/ALR5VTFPMCH5BA7FNGBBHPR4DR/action/author_attestation","sign_citation":"https://pith.science/pith/ALR5VTFPMCH5BA7FNGBBHPR4DR/action/citation_signature","submit_replication":"https://pith.science/pith/ALR5VTFPMCH5BA7FNGBBHPR4DR/action/replication_record"}},"created_at":"2026-05-18T01:11:09.616162+00:00","updated_at":"2026-05-18T01:11:09.616162+00:00"}