{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:I4XQNNPFLFLGU4BJENVEEJP5R2","short_pith_number":"pith:I4XQNNPF","schema_version":"1.0","canonical_sha256":"472f06b5e559566a7029236a4225fd8e9d4664f578543fac4d6672ca865b000e","source":{"kind":"arxiv","id":"2112.05416","version":1},"attestation_state":"computed","paper":{"title":"Optimizing Edge Detection for Image Segmentation with Multicut Penalties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Amirhossein Kardoost, Margret Keuper, Sebastian Ziegler, Steffen Jung","submitted_at":"2021-12-10T09:48:03Z","abstract_excerpt":"The Minimum Cost Multicut Problem (MP) is a popular way for obtaining a graph decomposition by optimizing binary edge labels over edge costs. While the formulation of a MP from independently estimated costs per edge is highly flexible and intuitive, solving the MP is NP-hard and time-expensive. As a remedy, recent work proposed to predict edge probabilities with awareness to potential conflicts by incorporating cycle constraints in the prediction process. We argue that such formulation, while providing a first step towards end-to-end learnable edge weights, is suboptimal, since it is built upo"},"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":"2112.05416","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2021-12-10T09:48:03Z","cross_cats_sorted":[],"title_canon_sha256":"bfae23438b5b85d3a53869969967fc55a01e0db21e05d4a2c68e761103135c3d","abstract_canon_sha256":"a7795823fb609d693a74a2776c20f2c5820d6b285db1dec97001c25e5ff74127"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:39:41.127380Z","signature_b64":"CoJTLlqu5HsgKbmj+GqBUMQBeP0SYo1zNzXXurnxZBeA1T4oDm9WX4TBAZA+fdZSqF9M7OXDhdpWCRy6yb/+Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"472f06b5e559566a7029236a4225fd8e9d4664f578543fac4d6672ca865b000e","last_reissued_at":"2026-07-05T03:39:41.126974Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:39:41.126974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimizing Edge Detection for Image Segmentation with Multicut Penalties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Amirhossein Kardoost, Margret Keuper, Sebastian Ziegler, Steffen Jung","submitted_at":"2021-12-10T09:48:03Z","abstract_excerpt":"The Minimum Cost Multicut Problem (MP) is a popular way for obtaining a graph decomposition by optimizing binary edge labels over edge costs. While the formulation of a MP from independently estimated costs per edge is highly flexible and intuitive, solving the MP is NP-hard and time-expensive. As a remedy, recent work proposed to predict edge probabilities with awareness to potential conflicts by incorporating cycle constraints in the prediction process. We argue that such formulation, while providing a first step towards end-to-end learnable edge weights, is suboptimal, since it is built upo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.05416","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2112.05416/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2112.05416","created_at":"2026-07-05T03:39:41.127035+00:00"},{"alias_kind":"arxiv_version","alias_value":"2112.05416v1","created_at":"2026-07-05T03:39:41.127035+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.05416","created_at":"2026-07-05T03:39:41.127035+00:00"},{"alias_kind":"pith_short_12","alias_value":"I4XQNNPFLFLG","created_at":"2026-07-05T03:39:41.127035+00:00"},{"alias_kind":"pith_short_16","alias_value":"I4XQNNPFLFLGU4BJ","created_at":"2026-07-05T03:39:41.127035+00:00"},{"alias_kind":"pith_short_8","alias_value":"I4XQNNPF","created_at":"2026-07-05T03:39:41.127035+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/I4XQNNPFLFLGU4BJENVEEJP5R2","json":"https://pith.science/pith/I4XQNNPFLFLGU4BJENVEEJP5R2.json","graph_json":"https://pith.science/api/pith-number/I4XQNNPFLFLGU4BJENVEEJP5R2/graph.json","events_json":"https://pith.science/api/pith-number/I4XQNNPFLFLGU4BJENVEEJP5R2/events.json","paper":"https://pith.science/paper/I4XQNNPF"},"agent_actions":{"view_html":"https://pith.science/pith/I4XQNNPFLFLGU4BJENVEEJP5R2","download_json":"https://pith.science/pith/I4XQNNPFLFLGU4BJENVEEJP5R2.json","view_paper":"https://pith.science/paper/I4XQNNPF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2112.05416&json=true","fetch_graph":"https://pith.science/api/pith-number/I4XQNNPFLFLGU4BJENVEEJP5R2/graph.json","fetch_events":"https://pith.science/api/pith-number/I4XQNNPFLFLGU4BJENVEEJP5R2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I4XQNNPFLFLGU4BJENVEEJP5R2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I4XQNNPFLFLGU4BJENVEEJP5R2/action/storage_attestation","attest_author":"https://pith.science/pith/I4XQNNPFLFLGU4BJENVEEJP5R2/action/author_attestation","sign_citation":"https://pith.science/pith/I4XQNNPFLFLGU4BJENVEEJP5R2/action/citation_signature","submit_replication":"https://pith.science/pith/I4XQNNPFLFLGU4BJENVEEJP5R2/action/replication_record"}},"created_at":"2026-07-05T03:39:41.127035+00:00","updated_at":"2026-07-05T03:39:41.127035+00:00"}