{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:LSY4Q3MPSBPC5JB2JRHWIDPBGE","short_pith_number":"pith:LSY4Q3MP","schema_version":"1.0","canonical_sha256":"5cb1c86d8f905e2ea43a4c4f640de1312d8e6ffab214357b220eddf7186e6013","source":{"kind":"arxiv","id":"1105.1178","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1105.1178","created_at":"2026-05-18T04:02:12.500460+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.1178v1","created_at":"2026-05-18T04:02:12.500460+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.1178","created_at":"2026-05-18T04:02:12.500460+00:00"},{"alias_kind":"pith_short_12","alias_value":"LSY4Q3MPSBPC","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_16","alias_value":"LSY4Q3MPSBPC5JB2","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_8","alias_value":"LSY4Q3MP","created_at":"2026-05-18T12:26:34.985390+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LSY4Q3MPSBPC5JB2JRHWIDPBGE","json":"https://pith.science/pith/LSY4Q3MPSBPC5JB2JRHWIDPBGE.json","graph_json":"https://pith.science/api/pith-number/LSY4Q3MPSBPC5JB2JRHWIDPBGE/graph.json","events_json":"https://pith.science/api/pith-number/LSY4Q3MPSBPC5JB2JRHWIDPBGE/events.json","paper":"https://pith.science/paper/LSY4Q3MP"},"agent_actions":{"view_html":"https://pith.science/pith/LSY4Q3MPSBPC5JB2JRHWIDPBGE","download_json":"https://pith.science/pith/LSY4Q3MPSBPC5JB2JRHWIDPBGE.json","view_paper":"https://pith.science/paper/LSY4Q3MP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.1178&json=true","fetch_graph":"https://pith.science/api/pith-number/LSY4Q3MPSBPC5JB2JRHWIDPBGE/graph.json","fetch_events":"https://pith.science/api/pith-number/LSY4Q3MPSBPC5JB2JRHWIDPBGE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LSY4Q3MPSBPC5JB2JRHWIDPBGE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LSY4Q3MPSBPC5JB2JRHWIDPBGE/action/storage_attestation","attest_author":"https://pith.science/pith/LSY4Q3MPSBPC5JB2JRHWIDPBGE/action/author_attestation","sign_citation":"https://pith.science/pith/LSY4Q3MPSBPC5JB2JRHWIDPBGE/action/citation_signature","submit_replication":"https://pith.science/pith/LSY4Q3MPSBPC5JB2JRHWIDPBGE/action/replication_record"}},"created_at":"2026-05-18T04:02:12.500460+00:00","updated_at":"2026-05-18T04:02:12.500460+00:00"}