{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2005:YF562JUBNKLJKRQWBXTKWQIE4C","short_pith_number":"pith:YF562JUB","canonical_record":{"source":{"id":"cs/0508101","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2005-08-23T18:37:50Z","cross_cats_sorted":["cs.AI","math.IT"],"title_canon_sha256":"1b27a2b26d2f06f3c690c488653e730ea16267742691df331799b7965a0e45e7","abstract_canon_sha256":"005928782a2f99ac984c0ae7272797f433671755aa616ed584620762b9e38743"},"schema_version":"1.0"},"canonical_sha256":"c17bed26816a969546160de6ab4104e089cc6665dbdcc91fbd78604ca8e1a4a2","source":{"kind":"arxiv","id":"cs/0508101","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0508101","created_at":"2026-05-18T04:00:49Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0508101v2","created_at":"2026-05-18T04:00:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0508101","created_at":"2026-05-18T04:00:49Z"},{"alias_kind":"pith_short_12","alias_value":"YF562JUBNKLJ","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"YF562JUBNKLJKRQW","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"YF562JUB","created_at":"2026-05-18T12:25:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2005:YF562JUBNKLJKRQWBXTKWQIE4C","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0508101","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2005-08-23T18:37:50Z","cross_cats_sorted":["cs.AI","math.IT"],"title_canon_sha256":"1b27a2b26d2f06f3c690c488653e730ea16267742691df331799b7965a0e45e7","abstract_canon_sha256":"005928782a2f99ac984c0ae7272797f433671755aa616ed584620762b9e38743"},"schema_version":"1.0"},"canonical_sha256":"c17bed26816a969546160de6ab4104e089cc6665dbdcc91fbd78604ca8e1a4a2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:49.799747Z","signature_b64":"ZDYv8yNLnolcu5/trds49yjqvPDJvjGWqfNm0QzQGlJUSMv/M7aYxxyikMLIQXj92jf6BggW00bJ4r76lh7LBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c17bed26816a969546160de6ab4104e089cc6665dbdcc91fbd78604ca8e1a4a2","last_reissued_at":"2026-05-18T04:00:49.799224Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:49.799224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0508101","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-18T04:00:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RXzsu+65trrmiENcuI5P78yeNKybbPV4ymqNLCcTP3xdH4VVQB7H+K65xbGMTFp+z7ZiouRV7kDUuFvPFhZPDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:23:48.657782Z"},"content_sha256":"77d03837f688c4e17ef67f0b43cb104ca9d6ffe6ec0241e96b5398aa15085d5a","schema_version":"1.0","event_id":"sha256:77d03837f688c4e17ef67f0b43cb104ca9d6ffe6ec0241e96b5398aa15085d5a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2005:YF562JUBNKLJKRQWBXTKWQIE4C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximum Weight Matching via Max-Product Belief Propagation","license":"","headline":"","cross_cats":["cs.AI","math.IT"],"primary_cat":"cs.IT","authors_text":"Devavrat Shah, Mayank Sharma, Mohsen Bayati","submitted_at":"2005-08-23T18:37:50Z","abstract_excerpt":"Max-product \"belief propagation\" is an iterative, local, message-passing algorithm for finding the maximum a posteriori (MAP) assignment of a discrete probability distribution specified by a graphical model. Despite the spectacular success of the algorithm in many application areas such as iterative decoding, computer vision and combinatorial optimization which involve graphs with many cycles, theoretical results about both correctness and convergence of the algorithm are known in few cases (Weiss-Freeman Wainwright, Yeddidia-Weiss-Freeman, Richardson-Urbanke}.\n  In this paper we consider the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0508101","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-18T04:00:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ebRX6zcmyKBeR9QwNm8/OaVbadZR/IYxxQYVucUtp9mROgl2S/wr4n84dVekBEiU2IQKOdm372PGN27hD9PzDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:23:48.658164Z"},"content_sha256":"0ade0ae9db1cc833efb0abae4304d49234b5caced18d266733e6b63cedd8045c","schema_version":"1.0","event_id":"sha256:0ade0ae9db1cc833efb0abae4304d49234b5caced18d266733e6b63cedd8045c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YF562JUBNKLJKRQWBXTKWQIE4C/bundle.json","state_url":"https://pith.science/pith/YF562JUBNKLJKRQWBXTKWQIE4C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YF562JUBNKLJKRQWBXTKWQIE4C/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-05T01:23:48Z","links":{"resolver":"https://pith.science/pith/YF562JUBNKLJKRQWBXTKWQIE4C","bundle":"https://pith.science/pith/YF562JUBNKLJKRQWBXTKWQIE4C/bundle.json","state":"https://pith.science/pith/YF562JUBNKLJKRQWBXTKWQIE4C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YF562JUBNKLJKRQWBXTKWQIE4C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:YF562JUBNKLJKRQWBXTKWQIE4C","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":"005928782a2f99ac984c0ae7272797f433671755aa616ed584620762b9e38743","cross_cats_sorted":["cs.AI","math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2005-08-23T18:37:50Z","title_canon_sha256":"1b27a2b26d2f06f3c690c488653e730ea16267742691df331799b7965a0e45e7"},"schema_version":"1.0","source":{"id":"cs/0508101","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0508101","created_at":"2026-05-18T04:00:49Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0508101v2","created_at":"2026-05-18T04:00:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0508101","created_at":"2026-05-18T04:00:49Z"},{"alias_kind":"pith_short_12","alias_value":"YF562JUBNKLJ","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"YF562JUBNKLJKRQW","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"YF562JUB","created_at":"2026-05-18T12:25:53Z"}],"graph_snapshots":[{"event_id":"sha256:0ade0ae9db1cc833efb0abae4304d49234b5caced18d266733e6b63cedd8045c","target":"graph","created_at":"2026-05-18T04:00:49Z","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":"Max-product \"belief propagation\" is an iterative, local, message-passing algorithm for finding the maximum a posteriori (MAP) assignment of a discrete probability distribution specified by a graphical model. Despite the spectacular success of the algorithm in many application areas such as iterative decoding, computer vision and combinatorial optimization which involve graphs with many cycles, theoretical results about both correctness and convergence of the algorithm are known in few cases (Weiss-Freeman Wainwright, Yeddidia-Weiss-Freeman, Richardson-Urbanke}.\n  In this paper we consider the ","authors_text":"Devavrat Shah, Mayank Sharma, Mohsen Bayati","cross_cats":["cs.AI","math.IT"],"headline":"","license":"","primary_cat":"cs.IT","submitted_at":"2005-08-23T18:37:50Z","title":"Maximum Weight Matching via Max-Product Belief Propagation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0508101","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:77d03837f688c4e17ef67f0b43cb104ca9d6ffe6ec0241e96b5398aa15085d5a","target":"record","created_at":"2026-05-18T04:00:49Z","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":"005928782a2f99ac984c0ae7272797f433671755aa616ed584620762b9e38743","cross_cats_sorted":["cs.AI","math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2005-08-23T18:37:50Z","title_canon_sha256":"1b27a2b26d2f06f3c690c488653e730ea16267742691df331799b7965a0e45e7"},"schema_version":"1.0","source":{"id":"cs/0508101","kind":"arxiv","version":2}},"canonical_sha256":"c17bed26816a969546160de6ab4104e089cc6665dbdcc91fbd78604ca8e1a4a2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c17bed26816a969546160de6ab4104e089cc6665dbdcc91fbd78604ca8e1a4a2","first_computed_at":"2026-05-18T04:00:49.799224Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:00:49.799224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZDYv8yNLnolcu5/trds49yjqvPDJvjGWqfNm0QzQGlJUSMv/M7aYxxyikMLIQXj92jf6BggW00bJ4r76lh7LBg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:00:49.799747Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0508101","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:77d03837f688c4e17ef67f0b43cb104ca9d6ffe6ec0241e96b5398aa15085d5a","sha256:0ade0ae9db1cc833efb0abae4304d49234b5caced18d266733e6b63cedd8045c"],"state_sha256":"444917ac7e350d1bd0f6e17add8a41040163e167a3af3ac03f9848f7ed2f0486"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ivmHcajITwIUunnsL2ZnHj+iffbFeffBJ8VafGDv1Iau0Tr48FeAEhLTXZw0VINGHkznL7INhKiboM5qC5/1DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T01:23:48.661103Z","bundle_sha256":"722d9ec63bf268ee5b0eda7782b2cdd21238172ba8df27c933c7b75c19f9d2f6"}}