{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:YYQCETDPOY2MAEZRWK5RL42HNE","short_pith_number":"pith:YYQCETDP","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"},"canonical_sha256":"c620224c6f7634c01331b2bb15f347691d1d04b43af6508ab02c3f3707e52676","source":{"kind":"arxiv","id":"1306.1167","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.1167","created_at":"2026-05-18T00:27:03Z"},{"alias_kind":"arxiv_version","alias_value":"1306.1167v2","created_at":"2026-05-18T00:27:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.1167","created_at":"2026-05-18T00:27:03Z"},{"alias_kind":"pith_short_12","alias_value":"YYQCETDPOY2M","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"YYQCETDPOY2MAEZR","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"YYQCETDP","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:YYQCETDPOY2MAEZRWK5RL42HNE","target":"record","payload":{"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"},"canonical_sha256":"c620224c6f7634c01331b2bb15f347691d1d04b43af6508ab02c3f3707e52676","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"},"source_kind":"arxiv","source_id":"1306.1167","source_version":2,"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:27:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0E4sKSb0cSmGzY9QDMYLUrhn0QX28LFe1ZBapus3YaGZVh2djxKgfEKd7XtI+hnQs+FlC4Tcc1v6NgNEZKqZDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T03:45:27.968794Z"},"content_sha256":"337db3b00ce8ce093b2f1d3243419934a496a26f96f877a72ed55c4a6dc22fe8","schema_version":"1.0","event_id":"sha256:337db3b00ce8ce093b2f1d3243419934a496a26f96f877a72ed55c4a6dc22fe8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:YYQCETDPOY2MAEZRWK5RL42HNE","target":"graph","payload":{"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"},"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:27:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k8ihz9+FpQXkb6tH4WG7J86Cmu9k/sXNWs+g8mgSg5xAf+Qp8rVxwIObDuj91aU3PXKf0mVXpUc2jH7VPT7JBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T03:45:27.969344Z"},"content_sha256":"910a6d8e9f5c7bfd9b83d49e1c17e4e676e434847cbbfed31111bab17cb7436d","schema_version":"1.0","event_id":"sha256:910a6d8e9f5c7bfd9b83d49e1c17e4e676e434847cbbfed31111bab17cb7436d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YYQCETDPOY2MAEZRWK5RL42HNE/bundle.json","state_url":"https://pith.science/pith/YYQCETDPOY2MAEZRWK5RL42HNE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YYQCETDPOY2MAEZRWK5RL42HNE/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-04T03:45:27Z","links":{"resolver":"https://pith.science/pith/YYQCETDPOY2MAEZRWK5RL42HNE","bundle":"https://pith.science/pith/YYQCETDPOY2MAEZRWK5RL42HNE/bundle.json","state":"https://pith.science/pith/YYQCETDPOY2MAEZRWK5RL42HNE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YYQCETDPOY2MAEZRWK5RL42HNE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:YYQCETDPOY2MAEZRWK5RL42HNE","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":"414a1465660958bc874297528e1d74a6933cc98597c0d3b4b708222f72ce4305","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-05T16:46:34Z","title_canon_sha256":"260308af5765a7ef80db5bf0fee47e1f656c7eb305a8686f166c3872e3ee30b8"},"schema_version":"1.0","source":{"id":"1306.1167","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.1167","created_at":"2026-05-18T00:27:03Z"},{"alias_kind":"arxiv_version","alias_value":"1306.1167v2","created_at":"2026-05-18T00:27:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.1167","created_at":"2026-05-18T00:27:03Z"},{"alias_kind":"pith_short_12","alias_value":"YYQCETDPOY2M","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"YYQCETDPOY2MAEZR","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"YYQCETDP","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:910a6d8e9f5c7bfd9b83d49e1c17e4e676e434847cbbfed31111bab17cb7436d","target":"graph","created_at":"2026-05-18T00:27:03Z","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 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","authors_text":"Andrew E. Gelfand, Jinwoo Shin, Michael Chertkov, Sejun Park, Sungsoo Ahn","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-05T16:46:34Z","title":"A Graphical Transformation for Belief Propagation: Maximum Weight Matchings and Odd-Sized Cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.1167","kind":"arxiv","version":2},"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:337db3b00ce8ce093b2f1d3243419934a496a26f96f877a72ed55c4a6dc22fe8","target":"record","created_at":"2026-05-18T00:27:03Z","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":"414a1465660958bc874297528e1d74a6933cc98597c0d3b4b708222f72ce4305","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-05T16:46:34Z","title_canon_sha256":"260308af5765a7ef80db5bf0fee47e1f656c7eb305a8686f166c3872e3ee30b8"},"schema_version":"1.0","source":{"id":"1306.1167","kind":"arxiv","version":2}},"canonical_sha256":"c620224c6f7634c01331b2bb15f347691d1d04b43af6508ab02c3f3707e52676","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c620224c6f7634c01331b2bb15f347691d1d04b43af6508ab02c3f3707e52676","first_computed_at":"2026-05-18T00:27:03.314484Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:03.314484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FokR0u/6Rhit+/HsqEIJ02AgSV/5nSuQtOlRUQ0I9/AmjpoQ265iFdicNiB2AC7Lx8o2Ubnvq+0WHF2ncNDcDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:03.315060Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.1167","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:337db3b00ce8ce093b2f1d3243419934a496a26f96f877a72ed55c4a6dc22fe8","sha256:910a6d8e9f5c7bfd9b83d49e1c17e4e676e434847cbbfed31111bab17cb7436d"],"state_sha256":"c2b300f7305c0ac27fad01d12df8031b89336f19df4c3dc62ea5a75c5561a377"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fZTFu846GEPyivoGGXD5fh8DKtkBUUtgcI4zLD96fZheb2fFnEOK1MJN1AeaNOVvgSRlJCivmAOMHau6tcpTCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T03:45:27.972160Z","bundle_sha256":"621fa64787960d1d499d8b5f964373fadd6e8862e2d54ea6b011792a1a5213cb"}}