{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ANTPQFQB5THOFMTTGD34F3WGFE","short_pith_number":"pith:ANTPQFQB","canonical_record":{"source":{"id":"1412.4972","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-12-16T12:18:34Z","cross_cats_sorted":[],"title_canon_sha256":"4e5a1efc18c62502f14d7ec6a3ed2a528868ce54ce0825c60120559e18f9aa27","abstract_canon_sha256":"6b508b1be151bed137cf30e023b37461f32ee3fbb94037dadb9882e25e62d20e"},"schema_version":"1.0"},"canonical_sha256":"0366f81601eccee2b27330f7c2eec62926b970c02ae605c69fd9066d80783578","source":{"kind":"arxiv","id":"1412.4972","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.4972","created_at":"2026-05-18T00:41:23Z"},{"alias_kind":"arxiv_version","alias_value":"1412.4972v5","created_at":"2026-05-18T00:41:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.4972","created_at":"2026-05-18T00:41:23Z"},{"alias_kind":"pith_short_12","alias_value":"ANTPQFQB5THO","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"ANTPQFQB5THOFMTT","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"ANTPQFQB","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ANTPQFQB5THOFMTTGD34F3WGFE","target":"record","payload":{"canonical_record":{"source":{"id":"1412.4972","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-12-16T12:18:34Z","cross_cats_sorted":[],"title_canon_sha256":"4e5a1efc18c62502f14d7ec6a3ed2a528868ce54ce0825c60120559e18f9aa27","abstract_canon_sha256":"6b508b1be151bed137cf30e023b37461f32ee3fbb94037dadb9882e25e62d20e"},"schema_version":"1.0"},"canonical_sha256":"0366f81601eccee2b27330f7c2eec62926b970c02ae605c69fd9066d80783578","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:23.509531Z","signature_b64":"Veg7E6PYYjDdXnjAyOAWXVK8wvzfyaMj7kfZOfCywrEjNwSjPJGk1mUURQpzPxAGiH/yXvdehcQjzOLD1pk7BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0366f81601eccee2b27330f7c2eec62926b970c02ae605c69fd9066d80783578","last_reissued_at":"2026-05-18T00:41:23.508835Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:23.508835Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.4972","source_version":5,"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:41:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xhkZaPxHJ872OXf1t6oLB1OIrPa6gK7P+2+vEGx3iDjWa2EDAI9lqy/89iaLTovRSUxwlOzfGMZyKIFZYMImCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T04:02:05.746587Z"},"content_sha256":"08ae93ad2356ec539b3ca840245154569695e7295d99e08680ff2ba341bedd2a","schema_version":"1.0","event_id":"sha256:08ae93ad2356ec539b3ca840245154569695e7295d99e08680ff2ba341bedd2a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ANTPQFQB5THOFMTTGD34F3WGFE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Max-Product Belief Propagation for Linear Programming: Applications to Combinatorial Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Jinwoo Shin, Sejun Park","submitted_at":"2014-12-16T12:18:34Z","abstract_excerpt":"The max-product {belief propagation} (BP) is a popular message-passing heuristic for approximating a maximum-a-posteriori (MAP) assignment in a joint distribution represented by a graphical model (GM). In the past years, it has been shown that BP can solve a few classes of linear programming (LP) formulations to combinatorial optimization problems including maximum weight matching, shortest path and network flow, i.e., BP can be used as a message-passing solver for certain combinatorial optimizations. However, those LPs and corresponding BP analysis are very sensitive to underlying problem set"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.4972","kind":"arxiv","version":5},"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:41:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BFTU7dmESOtB2VEt9YlP3erWrGK/y9VXlwGHcSWiSGcE1gLZVdzHni/PbtlZXM92qGliEZTUjpdIQMkZ0aU+Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T04:02:05.746951Z"},"content_sha256":"c1b96523e24f952e017ed3c8d2dd2b5c98ca55149d5382c5d238e58f1e26768b","schema_version":"1.0","event_id":"sha256:c1b96523e24f952e017ed3c8d2dd2b5c98ca55149d5382c5d238e58f1e26768b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ANTPQFQB5THOFMTTGD34F3WGFE/bundle.json","state_url":"https://pith.science/pith/ANTPQFQB5THOFMTTGD34F3WGFE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ANTPQFQB5THOFMTTGD34F3WGFE/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-20T04:02:05Z","links":{"resolver":"https://pith.science/pith/ANTPQFQB5THOFMTTGD34F3WGFE","bundle":"https://pith.science/pith/ANTPQFQB5THOFMTTGD34F3WGFE/bundle.json","state":"https://pith.science/pith/ANTPQFQB5THOFMTTGD34F3WGFE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ANTPQFQB5THOFMTTGD34F3WGFE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ANTPQFQB5THOFMTTGD34F3WGFE","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":"6b508b1be151bed137cf30e023b37461f32ee3fbb94037dadb9882e25e62d20e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-12-16T12:18:34Z","title_canon_sha256":"4e5a1efc18c62502f14d7ec6a3ed2a528868ce54ce0825c60120559e18f9aa27"},"schema_version":"1.0","source":{"id":"1412.4972","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.4972","created_at":"2026-05-18T00:41:23Z"},{"alias_kind":"arxiv_version","alias_value":"1412.4972v5","created_at":"2026-05-18T00:41:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.4972","created_at":"2026-05-18T00:41:23Z"},{"alias_kind":"pith_short_12","alias_value":"ANTPQFQB5THO","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"ANTPQFQB5THOFMTT","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"ANTPQFQB","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:c1b96523e24f952e017ed3c8d2dd2b5c98ca55149d5382c5d238e58f1e26768b","target":"graph","created_at":"2026-05-18T00:41:23Z","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":"The max-product {belief propagation} (BP) is a popular message-passing heuristic for approximating a maximum-a-posteriori (MAP) assignment in a joint distribution represented by a graphical model (GM). In the past years, it has been shown that BP can solve a few classes of linear programming (LP) formulations to combinatorial optimization problems including maximum weight matching, shortest path and network flow, i.e., BP can be used as a message-passing solver for certain combinatorial optimizations. However, those LPs and corresponding BP analysis are very sensitive to underlying problem set","authors_text":"Jinwoo Shin, Sejun Park","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-12-16T12:18:34Z","title":"Max-Product Belief Propagation for Linear Programming: Applications to Combinatorial Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.4972","kind":"arxiv","version":5},"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:08ae93ad2356ec539b3ca840245154569695e7295d99e08680ff2ba341bedd2a","target":"record","created_at":"2026-05-18T00:41:23Z","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":"6b508b1be151bed137cf30e023b37461f32ee3fbb94037dadb9882e25e62d20e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-12-16T12:18:34Z","title_canon_sha256":"4e5a1efc18c62502f14d7ec6a3ed2a528868ce54ce0825c60120559e18f9aa27"},"schema_version":"1.0","source":{"id":"1412.4972","kind":"arxiv","version":5}},"canonical_sha256":"0366f81601eccee2b27330f7c2eec62926b970c02ae605c69fd9066d80783578","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0366f81601eccee2b27330f7c2eec62926b970c02ae605c69fd9066d80783578","first_computed_at":"2026-05-18T00:41:23.508835Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:23.508835Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Veg7E6PYYjDdXnjAyOAWXVK8wvzfyaMj7kfZOfCywrEjNwSjPJGk1mUURQpzPxAGiH/yXvdehcQjzOLD1pk7BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:23.509531Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.4972","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:08ae93ad2356ec539b3ca840245154569695e7295d99e08680ff2ba341bedd2a","sha256:c1b96523e24f952e017ed3c8d2dd2b5c98ca55149d5382c5d238e58f1e26768b"],"state_sha256":"db5306aca2fae06b26560dd6956c33d445baf8293f51acd692af3ce7950a6c80"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yKUJvzQERFxK9MvL+VcN2czuV2izl/QVZQA0TnLmcJvZkUKrgKmmRjvG3Bm8VE+rtQ1mQ2Za0nHkNkimLAFLCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T04:02:05.748926Z","bundle_sha256":"8860d13d194108a65b275c9ef3f4d09f73b7c797b5a476a071344a27771ed919"}}