{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:LSY4Q3MPSBPC5JB2JRHWIDPBGE","short_pith_number":"pith:LSY4Q3MP","canonical_record":{"source":{"id":"1105.1178","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-05-05T21:24:37Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"c3b2263d47602e02cdda0b4a3d38721506c45ea5fee1c9c4a1b03afdf872f4d8","abstract_canon_sha256":"57d23d5a12473210519cceb5a73d1fb62ba617ec08463dfbc57269eb29ef19cd"},"schema_version":"1.0"},"canonical_sha256":"5cb1c86d8f905e2ea43a4c4f640de1312d8e6ffab214357b220eddf7186e6013","source":{"kind":"arxiv","id":"1105.1178","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.1178","created_at":"2026-05-18T04:02:12Z"},{"alias_kind":"arxiv_version","alias_value":"1105.1178v1","created_at":"2026-05-18T04:02:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.1178","created_at":"2026-05-18T04:02:12Z"},{"alias_kind":"pith_short_12","alias_value":"LSY4Q3MPSBPC","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"LSY4Q3MPSBPC5JB2","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"LSY4Q3MP","created_at":"2026-05-18T12:26:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:LSY4Q3MPSBPC5JB2JRHWIDPBGE","target":"record","payload":{"canonical_record":{"source":{"id":"1105.1178","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-05-05T21:24:37Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"c3b2263d47602e02cdda0b4a3d38721506c45ea5fee1c9c4a1b03afdf872f4d8","abstract_canon_sha256":"57d23d5a12473210519cceb5a73d1fb62ba617ec08463dfbc57269eb29ef19cd"},"schema_version":"1.0"},"canonical_sha256":"5cb1c86d8f905e2ea43a4c4f640de1312d8e6ffab214357b220eddf7186e6013","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:12.500990Z","signature_b64":"mci0eRzlP3UX5jRmPZjKVXtNvBpBeJQwxOTF2O2ZmcEl+RuALG8fDDJMcckt7zrcvJQz+AQYyNri4dameAABBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5cb1c86d8f905e2ea43a4c4f640de1312d8e6ffab214357b220eddf7186e6013","last_reissued_at":"2026-05-18T04:02:12.500380Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:12.500380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1105.1178","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-18T04:02:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BdBWepuiyf7kWlIqToCQhzYBPtMkrb783uHdOodc+PGkWEeGvg6eiQf7bEWeoFx1dl2P9rUczPG/stliuN7uDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:47:20.620470Z"},"content_sha256":"5ae4fc122bf3a302c65393f7e8c53315b03a61d00040572f2b2e3508b64816fb","schema_version":"1.0","event_id":"sha256:5ae4fc122bf3a302c65393f7e8c53315b03a61d00040572f2b2e3508b64816fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:LSY4Q3MPSBPC5JB2JRHWIDPBGE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Interpreting Graph Cuts as a Max-Product Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Brendan J. Frey, Daniel Tarlow, Inmar E. Givoni, Richard S. Zemel","submitted_at":"2011-05-05T21:24:37Z","abstract_excerpt":"The maximum a posteriori (MAP) configuration of binary variable models with submodular graph-structured energy functions can be found efficiently and exactly by graph cuts. Max-product belief propagation (MP) has been shown to be suboptimal on this class of energy functions by a canonical counterexample where MP converges to a suboptimal fixed point (Kulesza & Pereira, 2008).\n  In this work, we show that under a particular scheduling and damping scheme, MP is equivalent to graph cuts, and thus optimal. We explain the apparent contradiction by showing that with proper scheduling and damping, MP"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.1178","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-18T04:02:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1CbO8prv2y4eqKNwXQ907jKUbj7z7LHwPPJMEaJeCiRSqQbNtkFtglLOk55jzqQyVWCMAQPfTBcWVU5wWLKqDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:47:20.621206Z"},"content_sha256":"606f2814b387b698f224d0c2e46a75d9ed13d10a0302dc4f0c7ef78fda1517e4","schema_version":"1.0","event_id":"sha256:606f2814b387b698f224d0c2e46a75d9ed13d10a0302dc4f0c7ef78fda1517e4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LSY4Q3MPSBPC5JB2JRHWIDPBGE/bundle.json","state_url":"https://pith.science/pith/LSY4Q3MPSBPC5JB2JRHWIDPBGE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LSY4Q3MPSBPC5JB2JRHWIDPBGE/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-26T14:47:20Z","links":{"resolver":"https://pith.science/pith/LSY4Q3MPSBPC5JB2JRHWIDPBGE","bundle":"https://pith.science/pith/LSY4Q3MPSBPC5JB2JRHWIDPBGE/bundle.json","state":"https://pith.science/pith/LSY4Q3MPSBPC5JB2JRHWIDPBGE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LSY4Q3MPSBPC5JB2JRHWIDPBGE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:LSY4Q3MPSBPC5JB2JRHWIDPBGE","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":"57d23d5a12473210519cceb5a73d1fb62ba617ec08463dfbc57269eb29ef19cd","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-05-05T21:24:37Z","title_canon_sha256":"c3b2263d47602e02cdda0b4a3d38721506c45ea5fee1c9c4a1b03afdf872f4d8"},"schema_version":"1.0","source":{"id":"1105.1178","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.1178","created_at":"2026-05-18T04:02:12Z"},{"alias_kind":"arxiv_version","alias_value":"1105.1178v1","created_at":"2026-05-18T04:02:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.1178","created_at":"2026-05-18T04:02:12Z"},{"alias_kind":"pith_short_12","alias_value":"LSY4Q3MPSBPC","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"LSY4Q3MPSBPC5JB2","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"LSY4Q3MP","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:606f2814b387b698f224d0c2e46a75d9ed13d10a0302dc4f0c7ef78fda1517e4","target":"graph","created_at":"2026-05-18T04:02:12Z","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 maximum a posteriori (MAP) configuration of binary variable models with submodular graph-structured energy functions can be found efficiently and exactly by graph cuts. Max-product belief propagation (MP) has been shown to be suboptimal on this class of energy functions by a canonical counterexample where MP converges to a suboptimal fixed point (Kulesza & Pereira, 2008).\n  In this work, we show that under a particular scheduling and damping scheme, MP is equivalent to graph cuts, and thus optimal. We explain the apparent contradiction by showing that with proper scheduling and damping, MP","authors_text":"Brendan J. Frey, Daniel Tarlow, Inmar E. Givoni, Richard S. Zemel","cross_cats":["cs.DS","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-05-05T21:24:37Z","title":"Interpreting Graph Cuts as a Max-Product Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.1178","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:5ae4fc122bf3a302c65393f7e8c53315b03a61d00040572f2b2e3508b64816fb","target":"record","created_at":"2026-05-18T04:02:12Z","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":"57d23d5a12473210519cceb5a73d1fb62ba617ec08463dfbc57269eb29ef19cd","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-05-05T21:24:37Z","title_canon_sha256":"c3b2263d47602e02cdda0b4a3d38721506c45ea5fee1c9c4a1b03afdf872f4d8"},"schema_version":"1.0","source":{"id":"1105.1178","kind":"arxiv","version":1}},"canonical_sha256":"5cb1c86d8f905e2ea43a4c4f640de1312d8e6ffab214357b220eddf7186e6013","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5cb1c86d8f905e2ea43a4c4f640de1312d8e6ffab214357b220eddf7186e6013","first_computed_at":"2026-05-18T04:02:12.500380Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:02:12.500380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mci0eRzlP3UX5jRmPZjKVXtNvBpBeJQwxOTF2O2ZmcEl+RuALG8fDDJMcckt7zrcvJQz+AQYyNri4dameAABBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:02:12.500990Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.1178","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5ae4fc122bf3a302c65393f7e8c53315b03a61d00040572f2b2e3508b64816fb","sha256:606f2814b387b698f224d0c2e46a75d9ed13d10a0302dc4f0c7ef78fda1517e4"],"state_sha256":"67302684ec23d63c9ed09a2d13d18ae0e485511b8bef44f7f84001229474269f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y3TFJiurDU2C+lhisp+pFuzPqsIOQhZd8aEBUqGD/tlW3GdLMDiMIHsLNuINP9G1bRsjeoJ9p9Yf6v5eooCxBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T14:47:20.625030Z","bundle_sha256":"d00bce82f21ef09e92e8d8cac63c218e543abc12f222c7dcf8c8d6293a8eee27"}}