{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:77O2MVHJAVRPTZE23PRNVAA3LI","short_pith_number":"pith:77O2MVHJ","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"},"canonical_sha256":"ffdda654e90562f9e49adbe2da801b5a1eb8dd52376eef8c80e74f0b1b719e0e","source":{"kind":"arxiv","id":"1505.06973","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.06973","created_at":"2026-05-18T01:33:23Z"},{"alias_kind":"arxiv_version","alias_value":"1505.06973v2","created_at":"2026-05-18T01:33:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.06973","created_at":"2026-05-18T01:33:23Z"},{"alias_kind":"pith_short_12","alias_value":"77O2MVHJAVRP","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"77O2MVHJAVRPTZE2","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"77O2MVHJ","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:77O2MVHJAVRPTZE23PRNVAA3LI","target":"record","payload":{"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"},"canonical_sha256":"ffdda654e90562f9e49adbe2da801b5a1eb8dd52376eef8c80e74f0b1b719e0e","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"},"source_kind":"arxiv","source_id":"1505.06973","source_version":2,"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:33:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jqe4Cmcsn9dpsVTywOzCsQ0pogdiq4jX/rQ3NJ3/Mch9hSTDxnbT5ooHDt6Dp+P1G3ArzLww3wKfLjau0LqjCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:54:39.152958Z"},"content_sha256":"e7f656dcaa950a1f02ce167ffe91e1c993e6f1f3c2cd8448515a543a565a0084","schema_version":"1.0","event_id":"sha256:e7f656dcaa950a1f02ce167ffe91e1c993e6f1f3c2cd8448515a543a565a0084"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:77O2MVHJAVRPTZE23PRNVAA3LI","target":"graph","payload":{"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"},"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:33:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5F+EMpYfT6pZzCwYesl8Na+wahjWQ4Ng+IjnCkuhPFC1HEJOFAmTZWwnU4SkVNtTaMLMehBBjWgowmfl8prZCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:54:39.153697Z"},"content_sha256":"1d769c2d46256bcb8617a22559c6a57a3d44cd07f33f3e5fe008f2c5f7dc6e76","schema_version":"1.0","event_id":"sha256:1d769c2d46256bcb8617a22559c6a57a3d44cd07f33f3e5fe008f2c5f7dc6e76"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/77O2MVHJAVRPTZE23PRNVAA3LI/bundle.json","state_url":"https://pith.science/pith/77O2MVHJAVRPTZE23PRNVAA3LI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/77O2MVHJAVRPTZE23PRNVAA3LI/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-25T18:54:39Z","links":{"resolver":"https://pith.science/pith/77O2MVHJAVRPTZE23PRNVAA3LI","bundle":"https://pith.science/pith/77O2MVHJAVRPTZE23PRNVAA3LI/bundle.json","state":"https://pith.science/pith/77O2MVHJAVRPTZE23PRNVAA3LI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/77O2MVHJAVRPTZE23PRNVAA3LI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:77O2MVHJAVRPTZE23PRNVAA3LI","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":"dafe0c4799f573f97ce02adacb6af7553d8ed8d2eb3253fd4b1a8a27dcd06565","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-05-26T14:46:27Z","title_canon_sha256":"6061e73b04af234f223bb12a6ad6ff6968c81ae0fe6af7629c4637a29e2fafae"},"schema_version":"1.0","source":{"id":"1505.06973","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.06973","created_at":"2026-05-18T01:33:23Z"},{"alias_kind":"arxiv_version","alias_value":"1505.06973v2","created_at":"2026-05-18T01:33:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.06973","created_at":"2026-05-18T01:33:23Z"},{"alias_kind":"pith_short_12","alias_value":"77O2MVHJAVRP","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"77O2MVHJAVRPTZE2","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"77O2MVHJ","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:1d769c2d46256bcb8617a22559c6a57a3d44cd07f33f3e5fe008f2c5f7dc6e76","target":"graph","created_at":"2026-05-18T01:33: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":"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 ","authors_text":"Bjoern Andres, Evgeny Levinkov, Guillaume Lavou\\'e, Margret Keuper, Nicolas Bonneel, Thomas Brox","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-05-26T14:46:27Z","title":"Efficient Decomposition of Image and Mesh Graphs by Lifted Multicuts"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.06973","kind":"arxiv","version":2},"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:e7f656dcaa950a1f02ce167ffe91e1c993e6f1f3c2cd8448515a543a565a0084","target":"record","created_at":"2026-05-18T01:33: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":"dafe0c4799f573f97ce02adacb6af7553d8ed8d2eb3253fd4b1a8a27dcd06565","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-05-26T14:46:27Z","title_canon_sha256":"6061e73b04af234f223bb12a6ad6ff6968c81ae0fe6af7629c4637a29e2fafae"},"schema_version":"1.0","source":{"id":"1505.06973","kind":"arxiv","version":2}},"canonical_sha256":"ffdda654e90562f9e49adbe2da801b5a1eb8dd52376eef8c80e74f0b1b719e0e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ffdda654e90562f9e49adbe2da801b5a1eb8dd52376eef8c80e74f0b1b719e0e","first_computed_at":"2026-05-18T01:33:23.983766Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:33:23.983766Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"85pFHjlzjRYIjvcpuaDZAAp8KYbCqaYAMFeQsQd874JuDRjKGUpB0EU+Icfb2K824d45VQ+Os/uwt2yl1iFxDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:33:23.984368Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.06973","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e7f656dcaa950a1f02ce167ffe91e1c993e6f1f3c2cd8448515a543a565a0084","sha256:1d769c2d46256bcb8617a22559c6a57a3d44cd07f33f3e5fe008f2c5f7dc6e76"],"state_sha256":"b0592fcf08b97e218c4458720c60f2455507e7a9b4dd8de96c7b2f4a9d4d8dfc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xnhXG/YEvMUhph9LLeOTgZWruYoSZttJ3WfSBH9PuyRsiM6lQdNTUBoqU94/h1wdRHcEbvpsT4UjaBnPA4eQDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:54:39.159579Z","bundle_sha256":"f4a3893e477f5eaea5667f27b002bc7508bd6f6e67de42b7bff120b333e49a45"}}