{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:JYRLPOKHFFG77BIXKFCPEZWQAD","short_pith_number":"pith:JYRLPOKH","canonical_record":{"source":{"id":"1004.1586","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-04-09T16:15:42Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"f13be3cf6ffa872f50a9ed75bdaed3ad38f2271bc7b078f70f596cc5c1396d34","abstract_canon_sha256":"e3967e64aebade28a89d6847b1cf919501086d5c1bcd17f61b34d99496f02d04"},"schema_version":"1.0"},"canonical_sha256":"4e22b7b947294dff85175144f266d000fd66558567dfbd0bf116fde0b23b0455","source":{"kind":"arxiv","id":"1004.1586","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.1586","created_at":"2026-05-18T01:19:22Z"},{"alias_kind":"arxiv_version","alias_value":"1004.1586v4","created_at":"2026-05-18T01:19:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.1586","created_at":"2026-05-18T01:19:22Z"},{"alias_kind":"pith_short_12","alias_value":"JYRLPOKHFFG7","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"JYRLPOKHFFG77BIX","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"JYRLPOKH","created_at":"2026-05-18T12:26:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:JYRLPOKHFFG77BIXKFCPEZWQAD","target":"record","payload":{"canonical_record":{"source":{"id":"1004.1586","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-04-09T16:15:42Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"f13be3cf6ffa872f50a9ed75bdaed3ad38f2271bc7b078f70f596cc5c1396d34","abstract_canon_sha256":"e3967e64aebade28a89d6847b1cf919501086d5c1bcd17f61b34d99496f02d04"},"schema_version":"1.0"},"canonical_sha256":"4e22b7b947294dff85175144f266d000fd66558567dfbd0bf116fde0b23b0455","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:22.600264Z","signature_b64":"V0ggf+UskvYvRCcu8nMHSLsR4HMM4i5LNj6q/K7drLy+GfKDj0BZPAAEdqGbd480/xnJhupL6t63Vhyt2fvbAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e22b7b947294dff85175144f266d000fd66558567dfbd0bf116fde0b23b0455","last_reissued_at":"2026-05-18T01:19:22.599550Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:22.599550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1004.1586","source_version":4,"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-18T01:19:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TEVV4imNeI5gPgixiGkNmny4Kb/HMnJV3/klGLPKPO/kHW4rgyvs1WR77CX+AQ4YR9rul56uoDXlodOFFZe1DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:36:02.285371Z"},"content_sha256":"acbf80f930e20841b55cad4cbb387d7372eea5292f867fed4abb57cf9b78191b","schema_version":"1.0","event_id":"sha256:acbf80f930e20841b55cad4cbb387d7372eea5292f867fed4abb57cf9b78191b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:JYRLPOKHFFG77BIXKFCPEZWQAD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Belief Propagation for Min-cost Network Flow: Convergence and Correctness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DM","authors_text":"David Gamarnik, Devavrat Shah, Yehua Wei","submitted_at":"2010-04-09T16:15:42Z","abstract_excerpt":"Message passing type algorithms such as the so-called Belief Propagation algorithm have recently gained a lot of attention in the statistics, signal processing and machine learning communities as attractive algorithms for solving a variety of optimization and inference problems. As a decentralized, easy to implement and empirically successful algorithm, BP deserves attention from the theoretical standpoint, and here not much is known at the present stage. In order to fill this gap we consider the performance of the BP algorithm in the context of the capacitated minimum-cost network flow proble"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.1586","kind":"arxiv","version":4},"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-18T01:19:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wugjj/u3MkA6/QOdu4pHTuqnZxBMMv4aUVkBTrxRSPuzNEvTJqbuSRrCOTsR4jNhFE0pOoWpEhE1lvXSfeofDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:36:02.286048Z"},"content_sha256":"8915dfabd009b66336a2f3df2bd033e740b3e3b283dc339298f6ee673608857d","schema_version":"1.0","event_id":"sha256:8915dfabd009b66336a2f3df2bd033e740b3e3b283dc339298f6ee673608857d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JYRLPOKHFFG77BIXKFCPEZWQAD/bundle.json","state_url":"https://pith.science/pith/JYRLPOKHFFG77BIXKFCPEZWQAD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JYRLPOKHFFG77BIXKFCPEZWQAD/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-26T11:36:02Z","links":{"resolver":"https://pith.science/pith/JYRLPOKHFFG77BIXKFCPEZWQAD","bundle":"https://pith.science/pith/JYRLPOKHFFG77BIXKFCPEZWQAD/bundle.json","state":"https://pith.science/pith/JYRLPOKHFFG77BIXKFCPEZWQAD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JYRLPOKHFFG77BIXKFCPEZWQAD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:JYRLPOKHFFG77BIXKFCPEZWQAD","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":"e3967e64aebade28a89d6847b1cf919501086d5c1bcd17f61b34d99496f02d04","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-04-09T16:15:42Z","title_canon_sha256":"f13be3cf6ffa872f50a9ed75bdaed3ad38f2271bc7b078f70f596cc5c1396d34"},"schema_version":"1.0","source":{"id":"1004.1586","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.1586","created_at":"2026-05-18T01:19:22Z"},{"alias_kind":"arxiv_version","alias_value":"1004.1586v4","created_at":"2026-05-18T01:19:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.1586","created_at":"2026-05-18T01:19:22Z"},{"alias_kind":"pith_short_12","alias_value":"JYRLPOKHFFG7","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"JYRLPOKHFFG77BIX","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"JYRLPOKH","created_at":"2026-05-18T12:26:09Z"}],"graph_snapshots":[{"event_id":"sha256:8915dfabd009b66336a2f3df2bd033e740b3e3b283dc339298f6ee673608857d","target":"graph","created_at":"2026-05-18T01:19:22Z","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":"Message passing type algorithms such as the so-called Belief Propagation algorithm have recently gained a lot of attention in the statistics, signal processing and machine learning communities as attractive algorithms for solving a variety of optimization and inference problems. As a decentralized, easy to implement and empirically successful algorithm, BP deserves attention from the theoretical standpoint, and here not much is known at the present stage. In order to fill this gap we consider the performance of the BP algorithm in the context of the capacitated minimum-cost network flow proble","authors_text":"David Gamarnik, Devavrat Shah, Yehua Wei","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-04-09T16:15:42Z","title":"Belief Propagation for Min-cost Network Flow: Convergence and Correctness"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.1586","kind":"arxiv","version":4},"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:acbf80f930e20841b55cad4cbb387d7372eea5292f867fed4abb57cf9b78191b","target":"record","created_at":"2026-05-18T01:19:22Z","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":"e3967e64aebade28a89d6847b1cf919501086d5c1bcd17f61b34d99496f02d04","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-04-09T16:15:42Z","title_canon_sha256":"f13be3cf6ffa872f50a9ed75bdaed3ad38f2271bc7b078f70f596cc5c1396d34"},"schema_version":"1.0","source":{"id":"1004.1586","kind":"arxiv","version":4}},"canonical_sha256":"4e22b7b947294dff85175144f266d000fd66558567dfbd0bf116fde0b23b0455","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4e22b7b947294dff85175144f266d000fd66558567dfbd0bf116fde0b23b0455","first_computed_at":"2026-05-18T01:19:22.599550Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:22.599550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V0ggf+UskvYvRCcu8nMHSLsR4HMM4i5LNj6q/K7drLy+GfKDj0BZPAAEdqGbd480/xnJhupL6t63Vhyt2fvbAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:22.600264Z","signed_message":"canonical_sha256_bytes"},"source_id":"1004.1586","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:acbf80f930e20841b55cad4cbb387d7372eea5292f867fed4abb57cf9b78191b","sha256:8915dfabd009b66336a2f3df2bd033e740b3e3b283dc339298f6ee673608857d"],"state_sha256":"64aaae71cf43bbc94948f8433300371733c9a304e8e2745463160f10cfc3db7d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R2iA+yLnfvztmske6st1GGfXx1PiqoP3fQPopI4KP2/EG0O2EFigYQ8Z7visyQBOECxdsaE7lhCqkDOaNqD0Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T11:36:02.290058Z","bundle_sha256":"334042ad31d591936b9e375afee7c5716d7ea28d659f79c8b034a037d07a55f0"}}