{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:WBMSXVRTOXMA3FLFEF4JGOL5HR","short_pith_number":"pith:WBMSXVRT","canonical_record":{"source":{"id":"1211.3299","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-14T13:23:00Z","cross_cats_sorted":[],"title_canon_sha256":"441cdd34c00082421d5f91e928461258960b12a26e604139086f10dc8d8eaef7","abstract_canon_sha256":"2a9fed6c3fa5b56def5e2415476efa49c34dfa1d6316d6e1a9f90c5a1e772d31"},"schema_version":"1.0"},"canonical_sha256":"b0592bd63375d80d9565217893397d3c632f5fc473bbd9d48437485d29ae3f67","source":{"kind":"arxiv","id":"1211.3299","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.3299","created_at":"2026-05-18T03:40:50Z"},{"alias_kind":"arxiv_version","alias_value":"1211.3299v1","created_at":"2026-05-18T03:40:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.3299","created_at":"2026-05-18T03:40:50Z"},{"alias_kind":"pith_short_12","alias_value":"WBMSXVRTOXMA","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"WBMSXVRTOXMA3FLF","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"WBMSXVRT","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:WBMSXVRTOXMA3FLFEF4JGOL5HR","target":"record","payload":{"canonical_record":{"source":{"id":"1211.3299","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-14T13:23:00Z","cross_cats_sorted":[],"title_canon_sha256":"441cdd34c00082421d5f91e928461258960b12a26e604139086f10dc8d8eaef7","abstract_canon_sha256":"2a9fed6c3fa5b56def5e2415476efa49c34dfa1d6316d6e1a9f90c5a1e772d31"},"schema_version":"1.0"},"canonical_sha256":"b0592bd63375d80d9565217893397d3c632f5fc473bbd9d48437485d29ae3f67","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:40:50.266095Z","signature_b64":"WWrtWRQ2MAK08gAL2bJB+ueCmVK4JRp+/4yTXthG/zVRE+vuTQM9qa6nnQpBGQ09nHXS6/vZECoSJdAVzkzlCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0592bd63375d80d9565217893397d3c632f5fc473bbd9d48437485d29ae3f67","last_reissued_at":"2026-05-18T03:40:50.265264Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:40:50.265264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.3299","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-18T03:40:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CDDLfTPTmBe1KWdntBnZMEwl1jW+GtlKGrBZUUyZLcD15apP9K/vzq7TafWuE2KBTeNFNTooxKjhNCS3VtbMCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T08:56:17.762389Z"},"content_sha256":"39bcd96fdaca1193081d12a3b01ab397dfb18af468a4cc37fa0febb50523dc2a","schema_version":"1.0","event_id":"sha256:39bcd96fdaca1193081d12a3b01ab397dfb18af468a4cc37fa0febb50523dc2a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:WBMSXVRTOXMA3FLFEF4JGOL5HR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Smoothed Analysis of Belief Propagation for Minimum-Cost Flow and Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bodo Manthey, Heiko R\\\"oglin, Kamiel Cornelissen, Tobias Brunsch","submitted_at":"2012-11-14T13:23:00Z","abstract_excerpt":"Belief propagation (BP) is a message-passing heuristic for statistical inference in graphical models such as Bayesian networks and Markov random fields. BP is used to compute marginal distributions or maximum likelihood assignments and has applications in many areas, including machine learning, image processing, and computer vision. However, the theoretical understanding of the performance of BP is unsatisfactory.\n  Recently, BP has been applied to combinatorial optimization problems. It has been proved that BP can be used to compute maximum-weight matchings and minimum-cost flows for instance"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.3299","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-18T03:40:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"01/2U2IguMP+gATA5TH4AsbuuYOBhrN5M5P5tgUQMZGvx1ZHE664nbXqtAV4oTISp8Sq/e/K2EDf4NupryykCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T08:56:17.762936Z"},"content_sha256":"bcc5d6881b14a6a8ef03afa4c07160b517bae1c7c25ba62be8807fcbe7af769b","schema_version":"1.0","event_id":"sha256:bcc5d6881b14a6a8ef03afa4c07160b517bae1c7c25ba62be8807fcbe7af769b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WBMSXVRTOXMA3FLFEF4JGOL5HR/bundle.json","state_url":"https://pith.science/pith/WBMSXVRTOXMA3FLFEF4JGOL5HR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WBMSXVRTOXMA3FLFEF4JGOL5HR/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-22T08:56:17Z","links":{"resolver":"https://pith.science/pith/WBMSXVRTOXMA3FLFEF4JGOL5HR","bundle":"https://pith.science/pith/WBMSXVRTOXMA3FLFEF4JGOL5HR/bundle.json","state":"https://pith.science/pith/WBMSXVRTOXMA3FLFEF4JGOL5HR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WBMSXVRTOXMA3FLFEF4JGOL5HR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:WBMSXVRTOXMA3FLFEF4JGOL5HR","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":"2a9fed6c3fa5b56def5e2415476efa49c34dfa1d6316d6e1a9f90c5a1e772d31","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-14T13:23:00Z","title_canon_sha256":"441cdd34c00082421d5f91e928461258960b12a26e604139086f10dc8d8eaef7"},"schema_version":"1.0","source":{"id":"1211.3299","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.3299","created_at":"2026-05-18T03:40:50Z"},{"alias_kind":"arxiv_version","alias_value":"1211.3299v1","created_at":"2026-05-18T03:40:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.3299","created_at":"2026-05-18T03:40:50Z"},{"alias_kind":"pith_short_12","alias_value":"WBMSXVRTOXMA","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"WBMSXVRTOXMA3FLF","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"WBMSXVRT","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:bcc5d6881b14a6a8ef03afa4c07160b517bae1c7c25ba62be8807fcbe7af769b","target":"graph","created_at":"2026-05-18T03:40:50Z","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":"Belief propagation (BP) is a message-passing heuristic for statistical inference in graphical models such as Bayesian networks and Markov random fields. BP is used to compute marginal distributions or maximum likelihood assignments and has applications in many areas, including machine learning, image processing, and computer vision. However, the theoretical understanding of the performance of BP is unsatisfactory.\n  Recently, BP has been applied to combinatorial optimization problems. It has been proved that BP can be used to compute maximum-weight matchings and minimum-cost flows for instance","authors_text":"Bodo Manthey, Heiko R\\\"oglin, Kamiel Cornelissen, Tobias Brunsch","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-14T13:23:00Z","title":"Smoothed Analysis of Belief Propagation for Minimum-Cost Flow and Matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.3299","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:39bcd96fdaca1193081d12a3b01ab397dfb18af468a4cc37fa0febb50523dc2a","target":"record","created_at":"2026-05-18T03:40:50Z","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":"2a9fed6c3fa5b56def5e2415476efa49c34dfa1d6316d6e1a9f90c5a1e772d31","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-14T13:23:00Z","title_canon_sha256":"441cdd34c00082421d5f91e928461258960b12a26e604139086f10dc8d8eaef7"},"schema_version":"1.0","source":{"id":"1211.3299","kind":"arxiv","version":1}},"canonical_sha256":"b0592bd63375d80d9565217893397d3c632f5fc473bbd9d48437485d29ae3f67","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b0592bd63375d80d9565217893397d3c632f5fc473bbd9d48437485d29ae3f67","first_computed_at":"2026-05-18T03:40:50.265264Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:40:50.265264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WWrtWRQ2MAK08gAL2bJB+ueCmVK4JRp+/4yTXthG/zVRE+vuTQM9qa6nnQpBGQ09nHXS6/vZECoSJdAVzkzlCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:40:50.266095Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.3299","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:39bcd96fdaca1193081d12a3b01ab397dfb18af468a4cc37fa0febb50523dc2a","sha256:bcc5d6881b14a6a8ef03afa4c07160b517bae1c7c25ba62be8807fcbe7af769b"],"state_sha256":"7f6f5344bcb27f3c1e600754b5614f9d8137dfe097acefc5efa58e1b46dacd67"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cwPA48Q8cshxEklA91uDKcVcH9xdTfrH+AcjPT05bp4Nf7VoeRg7jLtjWAZLvSXvEwcpfzS+Np1JCMli/V5OBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T08:56:17.766582Z","bundle_sha256":"0178923417a3051d08be88316d5709e28ddbe82e0e23e999f47d1ac65ddab9b5"}}