{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:OMM23LW34GGQHKKB3NWOGGV3Z5","short_pith_number":"pith:OMM23LW3","schema_version":"1.0","canonical_sha256":"7319adaedbe18d03a941db6ce31abbcf6a639898b9b45493aecd057bb210cbad","source":{"kind":"arxiv","id":"1709.06525","version":1},"attestation_state":"computed","paper":{"title":"Inference in Graphical Models via Semidefinite Programming Hierarchies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"stat.ML","authors_text":"Andrea Montanari, Murat A. Erdogdu, Yash Deshpande","submitted_at":"2017-09-19T16:45:30Z","abstract_excerpt":"Maximum A posteriori Probability (MAP) inference in graphical models amounts to solving a graph-structured combinatorial optimization problem. Popular inference algorithms such as belief propagation (BP) and generalized belief propagation (GBP) are intimately related to linear programming (LP) relaxation within the Sherali-Adams hierarchy. Despite the popularity of these algorithms, it is well understood that the Sum-of-Squares (SOS) hierarchy based on semidefinite programming (SDP) can provide superior guarantees. Unfortunately, SOS relaxations for a graph with $n$ vertices require solving an"},"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":"1709.06525","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-09-19T16:45:30Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"cdf832b761176b1e49a0f9ff86c4b034ce8d344c6bb4a346f63704534cc1ab41","abstract_canon_sha256":"606e45ba3d343e0a09475a2a436e9dcdc248ec5457b9692f6a52d0862773eacf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:45.519353Z","signature_b64":"PQvjO3GGme+WOW6SJEoeRMMZ6ycdvVaBmb50fXy3Z+/JsRGYplim4Dw3VMsEXuY/RR/cJa6NN/rVb8EM1pAHAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7319adaedbe18d03a941db6ce31abbcf6a639898b9b45493aecd057bb210cbad","last_reissued_at":"2026-05-18T00:34:45.518587Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:45.518587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Inference in Graphical Models via Semidefinite Programming Hierarchies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"stat.ML","authors_text":"Andrea Montanari, Murat A. Erdogdu, Yash Deshpande","submitted_at":"2017-09-19T16:45:30Z","abstract_excerpt":"Maximum A posteriori Probability (MAP) inference in graphical models amounts to solving a graph-structured combinatorial optimization problem. Popular inference algorithms such as belief propagation (BP) and generalized belief propagation (GBP) are intimately related to linear programming (LP) relaxation within the Sherali-Adams hierarchy. Despite the popularity of these algorithms, it is well understood that the Sum-of-Squares (SOS) hierarchy based on semidefinite programming (SDP) can provide superior guarantees. Unfortunately, SOS relaxations for a graph with $n$ vertices require solving an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.06525","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":"1709.06525","created_at":"2026-05-18T00:34:45.518724+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.06525v1","created_at":"2026-05-18T00:34:45.518724+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.06525","created_at":"2026-05-18T00:34:45.518724+00:00"},{"alias_kind":"pith_short_12","alias_value":"OMM23LW34GGQ","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"OMM23LW34GGQHKKB","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"OMM23LW3","created_at":"2026-05-18T12:31:34.259226+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/OMM23LW34GGQHKKB3NWOGGV3Z5","json":"https://pith.science/pith/OMM23LW34GGQHKKB3NWOGGV3Z5.json","graph_json":"https://pith.science/api/pith-number/OMM23LW34GGQHKKB3NWOGGV3Z5/graph.json","events_json":"https://pith.science/api/pith-number/OMM23LW34GGQHKKB3NWOGGV3Z5/events.json","paper":"https://pith.science/paper/OMM23LW3"},"agent_actions":{"view_html":"https://pith.science/pith/OMM23LW34GGQHKKB3NWOGGV3Z5","download_json":"https://pith.science/pith/OMM23LW34GGQHKKB3NWOGGV3Z5.json","view_paper":"https://pith.science/paper/OMM23LW3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.06525&json=true","fetch_graph":"https://pith.science/api/pith-number/OMM23LW34GGQHKKB3NWOGGV3Z5/graph.json","fetch_events":"https://pith.science/api/pith-number/OMM23LW34GGQHKKB3NWOGGV3Z5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OMM23LW34GGQHKKB3NWOGGV3Z5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OMM23LW34GGQHKKB3NWOGGV3Z5/action/storage_attestation","attest_author":"https://pith.science/pith/OMM23LW34GGQHKKB3NWOGGV3Z5/action/author_attestation","sign_citation":"https://pith.science/pith/OMM23LW34GGQHKKB3NWOGGV3Z5/action/citation_signature","submit_replication":"https://pith.science/pith/OMM23LW34GGQHKKB3NWOGGV3Z5/action/replication_record"}},"created_at":"2026-05-18T00:34:45.518724+00:00","updated_at":"2026-05-18T00:34:45.518724+00:00"}