{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:YYQCETDPOY2MAEZRWK5RL42HNE","short_pith_number":"pith:YYQCETDP","schema_version":"1.0","canonical_sha256":"c620224c6f7634c01331b2bb15f347691d1d04b43af6508ab02c3f3707e52676","source":{"kind":"arxiv","id":"1306.1167","version":2},"attestation_state":"computed","paper":{"title":"A Graphical Transformation for Belief Propagation: Maximum Weight Matchings and Odd-Sized Cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrew E. Gelfand, Jinwoo Shin, Michael Chertkov, Sejun Park, Sungsoo Ahn","submitted_at":"2013-06-05T16:46:34Z","abstract_excerpt":"We study the Maximum Weight Matching (MWM) problem for general graphs through the max-product Belief Propagation (BP) and related Linear Programming (LP). The BP approach provides distributed heuristics for finding the Maximum A Posteriori (MAP) assignment in a joint probability distribution represented by a Graphical Model (GM) and respective LPs can be considered as continuous relaxations of the discrete MAP problem. It was recently shown that a BP algorithm converges to the correct MWM assignment under a simple GM formulation of MAP/MWM as long as the corresponding LP relaxation is tight. F"},"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":"1306.1167","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-05T16:46:34Z","cross_cats_sorted":[],"title_canon_sha256":"260308af5765a7ef80db5bf0fee47e1f656c7eb305a8686f166c3872e3ee30b8","abstract_canon_sha256":"414a1465660958bc874297528e1d74a6933cc98597c0d3b4b708222f72ce4305"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:03.315060Z","signature_b64":"FokR0u/6Rhit+/HsqEIJ02AgSV/5nSuQtOlRUQ0I9/AmjpoQ265iFdicNiB2AC7Lx8o2Ubnvq+0WHF2ncNDcDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c620224c6f7634c01331b2bb15f347691d1d04b43af6508ab02c3f3707e52676","last_reissued_at":"2026-05-18T00:27:03.314484Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:03.314484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Graphical Transformation for Belief Propagation: Maximum Weight Matchings and Odd-Sized Cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrew E. Gelfand, Jinwoo Shin, Michael Chertkov, Sejun Park, Sungsoo Ahn","submitted_at":"2013-06-05T16:46:34Z","abstract_excerpt":"We study the Maximum Weight Matching (MWM) problem for general graphs through the max-product Belief Propagation (BP) and related Linear Programming (LP). The BP approach provides distributed heuristics for finding the Maximum A Posteriori (MAP) assignment in a joint probability distribution represented by a Graphical Model (GM) and respective LPs can be considered as continuous relaxations of the discrete MAP problem. It was recently shown that a BP algorithm converges to the correct MWM assignment under a simple GM formulation of MAP/MWM as long as the corresponding LP relaxation is tight. F"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.1167","kind":"arxiv","version":2},"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":"1306.1167","created_at":"2026-05-18T00:27:03.314558+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.1167v2","created_at":"2026-05-18T00:27:03.314558+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.1167","created_at":"2026-05-18T00:27:03.314558+00:00"},{"alias_kind":"pith_short_12","alias_value":"YYQCETDPOY2M","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"YYQCETDPOY2MAEZR","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"YYQCETDP","created_at":"2026-05-18T12:28:09.283467+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/YYQCETDPOY2MAEZRWK5RL42HNE","json":"https://pith.science/pith/YYQCETDPOY2MAEZRWK5RL42HNE.json","graph_json":"https://pith.science/api/pith-number/YYQCETDPOY2MAEZRWK5RL42HNE/graph.json","events_json":"https://pith.science/api/pith-number/YYQCETDPOY2MAEZRWK5RL42HNE/events.json","paper":"https://pith.science/paper/YYQCETDP"},"agent_actions":{"view_html":"https://pith.science/pith/YYQCETDPOY2MAEZRWK5RL42HNE","download_json":"https://pith.science/pith/YYQCETDPOY2MAEZRWK5RL42HNE.json","view_paper":"https://pith.science/paper/YYQCETDP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.1167&json=true","fetch_graph":"https://pith.science/api/pith-number/YYQCETDPOY2MAEZRWK5RL42HNE/graph.json","fetch_events":"https://pith.science/api/pith-number/YYQCETDPOY2MAEZRWK5RL42HNE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YYQCETDPOY2MAEZRWK5RL42HNE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YYQCETDPOY2MAEZRWK5RL42HNE/action/storage_attestation","attest_author":"https://pith.science/pith/YYQCETDPOY2MAEZRWK5RL42HNE/action/author_attestation","sign_citation":"https://pith.science/pith/YYQCETDPOY2MAEZRWK5RL42HNE/action/citation_signature","submit_replication":"https://pith.science/pith/YYQCETDPOY2MAEZRWK5RL42HNE/action/replication_record"}},"created_at":"2026-05-18T00:27:03.314558+00:00","updated_at":"2026-05-18T00:27:03.314558+00:00"}