{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:OMM23LW34GGQHKKB3NWOGGV3Z5","short_pith_number":"pith:OMM23LW3","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"},"canonical_sha256":"7319adaedbe18d03a941db6ce31abbcf6a639898b9b45493aecd057bb210cbad","source":{"kind":"arxiv","id":"1709.06525","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.06525","created_at":"2026-05-18T00:34:45Z"},{"alias_kind":"arxiv_version","alias_value":"1709.06525v1","created_at":"2026-05-18T00:34:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.06525","created_at":"2026-05-18T00:34:45Z"},{"alias_kind":"pith_short_12","alias_value":"OMM23LW34GGQ","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OMM23LW34GGQHKKB","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OMM23LW3","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:OMM23LW34GGQHKKB3NWOGGV3Z5","target":"record","payload":{"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"},"canonical_sha256":"7319adaedbe18d03a941db6ce31abbcf6a639898b9b45493aecd057bb210cbad","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"},"source_kind":"arxiv","source_id":"1709.06525","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-18T00:34:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"12fsq9i9xerizMBVYHPnSg7hNrlNtKc/4lmubMREe/vrIcoIfe085SlR8sDTZdMyyxhVKGjJfV9T6H3t56ZkAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:26:01.272005Z"},"content_sha256":"a4bdfde26222c19add186370b7ec648574de57f76f7606bb23114c22c1a6572f","schema_version":"1.0","event_id":"sha256:a4bdfde26222c19add186370b7ec648574de57f76f7606bb23114c22c1a6572f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:OMM23LW34GGQHKKB3NWOGGV3Z5","target":"graph","payload":{"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"},"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-18T00:34:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F3WCRf/q9bAbr8X/B7V/YWlhgnB10uwlIKIVT6wj8RsZ82LivvR7jh1XihpYM/kWMvhxIODDOxpdhpeQfmmRCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:26:01.272546Z"},"content_sha256":"0f20a1396a0d720b02b7bcd7564670360ba49e7f354cd1701792e3b40a5d4da8","schema_version":"1.0","event_id":"sha256:0f20a1396a0d720b02b7bcd7564670360ba49e7f354cd1701792e3b40a5d4da8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OMM23LW34GGQHKKB3NWOGGV3Z5/bundle.json","state_url":"https://pith.science/pith/OMM23LW34GGQHKKB3NWOGGV3Z5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OMM23LW34GGQHKKB3NWOGGV3Z5/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-05-27T09:26:01Z","links":{"resolver":"https://pith.science/pith/OMM23LW34GGQHKKB3NWOGGV3Z5","bundle":"https://pith.science/pith/OMM23LW34GGQHKKB3NWOGGV3Z5/bundle.json","state":"https://pith.science/pith/OMM23LW34GGQHKKB3NWOGGV3Z5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OMM23LW34GGQHKKB3NWOGGV3Z5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:OMM23LW34GGQHKKB3NWOGGV3Z5","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":"606e45ba3d343e0a09475a2a436e9dcdc248ec5457b9692f6a52d0862773eacf","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-09-19T16:45:30Z","title_canon_sha256":"cdf832b761176b1e49a0f9ff86c4b034ce8d344c6bb4a346f63704534cc1ab41"},"schema_version":"1.0","source":{"id":"1709.06525","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.06525","created_at":"2026-05-18T00:34:45Z"},{"alias_kind":"arxiv_version","alias_value":"1709.06525v1","created_at":"2026-05-18T00:34:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.06525","created_at":"2026-05-18T00:34:45Z"},{"alias_kind":"pith_short_12","alias_value":"OMM23LW34GGQ","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OMM23LW34GGQHKKB","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OMM23LW3","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:0f20a1396a0d720b02b7bcd7564670360ba49e7f354cd1701792e3b40a5d4da8","target":"graph","created_at":"2026-05-18T00:34:45Z","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":"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","authors_text":"Andrea Montanari, Murat A. Erdogdu, Yash Deshpande","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-09-19T16:45:30Z","title":"Inference in Graphical Models via Semidefinite Programming Hierarchies"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.06525","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:a4bdfde26222c19add186370b7ec648574de57f76f7606bb23114c22c1a6572f","target":"record","created_at":"2026-05-18T00:34:45Z","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":"606e45ba3d343e0a09475a2a436e9dcdc248ec5457b9692f6a52d0862773eacf","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-09-19T16:45:30Z","title_canon_sha256":"cdf832b761176b1e49a0f9ff86c4b034ce8d344c6bb4a346f63704534cc1ab41"},"schema_version":"1.0","source":{"id":"1709.06525","kind":"arxiv","version":1}},"canonical_sha256":"7319adaedbe18d03a941db6ce31abbcf6a639898b9b45493aecd057bb210cbad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7319adaedbe18d03a941db6ce31abbcf6a639898b9b45493aecd057bb210cbad","first_computed_at":"2026-05-18T00:34:45.518587Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:45.518587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PQvjO3GGme+WOW6SJEoeRMMZ6ycdvVaBmb50fXy3Z+/JsRGYplim4Dw3VMsEXuY/RR/cJa6NN/rVb8EM1pAHAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:45.519353Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.06525","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a4bdfde26222c19add186370b7ec648574de57f76f7606bb23114c22c1a6572f","sha256:0f20a1396a0d720b02b7bcd7564670360ba49e7f354cd1701792e3b40a5d4da8"],"state_sha256":"ff0a9338e8112a6c3c25312cc3f6a7504286e8c5b86bb9f557eb80e16e312e83"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AE5QfnxUT2aq3u+juEsayF2PYWUAoqyvmHbGQaVmP+6EXcI9WaaXFfUpQN1nf3DsG1jJj8jF5/N9QgVJS1YjDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T09:26:01.275547Z","bundle_sha256":"dd4a4b834fccd318dab64561aa6317dd384e81210240a1f640305ab19b6a4c42"}}