{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:77O2MVHJAVRPTZE23PRNVAA3LI","short_pith_number":"pith:77O2MVHJ","schema_version":"1.0","canonical_sha256":"ffdda654e90562f9e49adbe2da801b5a1eb8dd52376eef8c80e74f0b1b719e0e","source":{"kind":"arxiv","id":"1505.06973","version":2},"attestation_state":"computed","paper":{"title":"Efficient Decomposition of Image and Mesh Graphs by Lifted Multicuts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Bjoern Andres, Evgeny Levinkov, Guillaume Lavou\\'e, Margret Keuper, Nicolas Bonneel, Thomas Brox","submitted_at":"2015-05-26T14:46:27Z","abstract_excerpt":"Formulations of the Image Decomposition Problem as a Multicut Problem (MP) w.r.t. a superpixel graph have received considerable attention. In contrast, instances of the MP w.r.t. a pixel grid graph have received little attention, firstly, because the MP is NP-hard and instances w.r.t. a pixel grid graph are hard to solve in practice, and, secondly, due to the lack of long-range terms in the objective function of the MP. We propose a generalization of the MP with long-range terms (LMP). We design and implement two efficient algorithms (primal feasible heuristics) for the MP and LMP which allow "},"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":"1505.06973","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-05-26T14:46:27Z","cross_cats_sorted":[],"title_canon_sha256":"6061e73b04af234f223bb12a6ad6ff6968c81ae0fe6af7629c4637a29e2fafae","abstract_canon_sha256":"dafe0c4799f573f97ce02adacb6af7553d8ed8d2eb3253fd4b1a8a27dcd06565"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:23.984368Z","signature_b64":"85pFHjlzjRYIjvcpuaDZAAp8KYbCqaYAMFeQsQd874JuDRjKGUpB0EU+Icfb2K824d45VQ+Os/uwt2yl1iFxDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ffdda654e90562f9e49adbe2da801b5a1eb8dd52376eef8c80e74f0b1b719e0e","last_reissued_at":"2026-05-18T01:33:23.983766Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:23.983766Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Decomposition of Image and Mesh Graphs by Lifted Multicuts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Bjoern Andres, Evgeny Levinkov, Guillaume Lavou\\'e, Margret Keuper, Nicolas Bonneel, Thomas Brox","submitted_at":"2015-05-26T14:46:27Z","abstract_excerpt":"Formulations of the Image Decomposition Problem as a Multicut Problem (MP) w.r.t. a superpixel graph have received considerable attention. In contrast, instances of the MP w.r.t. a pixel grid graph have received little attention, firstly, because the MP is NP-hard and instances w.r.t. a pixel grid graph are hard to solve in practice, and, secondly, due to the lack of long-range terms in the objective function of the MP. We propose a generalization of the MP with long-range terms (LMP). We design and implement two efficient algorithms (primal feasible heuristics) for the MP and LMP which allow "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.06973","kind":"arxiv","version":2},"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":"1505.06973","created_at":"2026-05-18T01:33:23.983856+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.06973v2","created_at":"2026-05-18T01:33:23.983856+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.06973","created_at":"2026-05-18T01:33:23.983856+00:00"},{"alias_kind":"pith_short_12","alias_value":"77O2MVHJAVRP","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"77O2MVHJAVRPTZE2","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"77O2MVHJ","created_at":"2026-05-18T12:29:07.941421+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/77O2MVHJAVRPTZE23PRNVAA3LI","json":"https://pith.science/pith/77O2MVHJAVRPTZE23PRNVAA3LI.json","graph_json":"https://pith.science/api/pith-number/77O2MVHJAVRPTZE23PRNVAA3LI/graph.json","events_json":"https://pith.science/api/pith-number/77O2MVHJAVRPTZE23PRNVAA3LI/events.json","paper":"https://pith.science/paper/77O2MVHJ"},"agent_actions":{"view_html":"https://pith.science/pith/77O2MVHJAVRPTZE23PRNVAA3LI","download_json":"https://pith.science/pith/77O2MVHJAVRPTZE23PRNVAA3LI.json","view_paper":"https://pith.science/paper/77O2MVHJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.06973&json=true","fetch_graph":"https://pith.science/api/pith-number/77O2MVHJAVRPTZE23PRNVAA3LI/graph.json","fetch_events":"https://pith.science/api/pith-number/77O2MVHJAVRPTZE23PRNVAA3LI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/77O2MVHJAVRPTZE23PRNVAA3LI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/77O2MVHJAVRPTZE23PRNVAA3LI/action/storage_attestation","attest_author":"https://pith.science/pith/77O2MVHJAVRPTZE23PRNVAA3LI/action/author_attestation","sign_citation":"https://pith.science/pith/77O2MVHJAVRPTZE23PRNVAA3LI/action/citation_signature","submit_replication":"https://pith.science/pith/77O2MVHJAVRPTZE23PRNVAA3LI/action/replication_record"}},"created_at":"2026-05-18T01:33:23.983856+00:00","updated_at":"2026-05-18T01:33:23.983856+00:00"}