{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:I4XQNNPFLFLGU4BJENVEEJP5R2","short_pith_number":"pith:I4XQNNPF","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"},"canonical_sha256":"472f06b5e559566a7029236a4225fd8e9d4664f578543fac4d6672ca865b000e","source":{"kind":"arxiv","id":"2112.05416","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.05416","created_at":"2026-07-05T03:39:41Z"},{"alias_kind":"arxiv_version","alias_value":"2112.05416v1","created_at":"2026-07-05T03:39:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.05416","created_at":"2026-07-05T03:39:41Z"},{"alias_kind":"pith_short_12","alias_value":"I4XQNNPFLFLG","created_at":"2026-07-05T03:39:41Z"},{"alias_kind":"pith_short_16","alias_value":"I4XQNNPFLFLGU4BJ","created_at":"2026-07-05T03:39:41Z"},{"alias_kind":"pith_short_8","alias_value":"I4XQNNPF","created_at":"2026-07-05T03:39:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:I4XQNNPFLFLGU4BJENVEEJP5R2","target":"record","payload":{"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"},"canonical_sha256":"472f06b5e559566a7029236a4225fd8e9d4664f578543fac4d6672ca865b000e","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"},"source_kind":"arxiv","source_id":"2112.05416","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-07-05T03:39:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c6xZhiK6tVxUW8oSdgxTK72w+Yhbenn2GOS+e80rIBdz/lXYyi35Rkru1LmIED3efIq58JrgbVe2s+Wck+dXBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T19:56:13.295202Z"},"content_sha256":"1a55f847a835ff5a09dc8c2aae335379710e266d6f8a96cd20a46f82126dc67e","schema_version":"1.0","event_id":"sha256:1a55f847a835ff5a09dc8c2aae335379710e266d6f8a96cd20a46f82126dc67e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:I4XQNNPFLFLGU4BJENVEEJP5R2","target":"graph","payload":{"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"},"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-07-05T03:39:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H7Idth46XsLuO1TPK7vaTOk2YI9Q2ratoZt1PnUrBmkljiF2EzyOL7z1URA8JIGpSkbXHXyEgPXZLQIfMGQNCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T19:56:13.296071Z"},"content_sha256":"e6d775b3cd9f24180a6305f6410db174aa20884618948152f19af0a0cc7e9598","schema_version":"1.0","event_id":"sha256:e6d775b3cd9f24180a6305f6410db174aa20884618948152f19af0a0cc7e9598"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I4XQNNPFLFLGU4BJENVEEJP5R2/bundle.json","state_url":"https://pith.science/pith/I4XQNNPFLFLGU4BJENVEEJP5R2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I4XQNNPFLFLGU4BJENVEEJP5R2/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-08-05T19:56:13Z","links":{"resolver":"https://pith.science/pith/I4XQNNPFLFLGU4BJENVEEJP5R2","bundle":"https://pith.science/pith/I4XQNNPFLFLGU4BJENVEEJP5R2/bundle.json","state":"https://pith.science/pith/I4XQNNPFLFLGU4BJENVEEJP5R2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I4XQNNPFLFLGU4BJENVEEJP5R2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:I4XQNNPFLFLGU4BJENVEEJP5R2","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":"a7795823fb609d693a74a2776c20f2c5820d6b285db1dec97001c25e5ff74127","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2021-12-10T09:48:03Z","title_canon_sha256":"bfae23438b5b85d3a53869969967fc55a01e0db21e05d4a2c68e761103135c3d"},"schema_version":"1.0","source":{"id":"2112.05416","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.05416","created_at":"2026-07-05T03:39:41Z"},{"alias_kind":"arxiv_version","alias_value":"2112.05416v1","created_at":"2026-07-05T03:39:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.05416","created_at":"2026-07-05T03:39:41Z"},{"alias_kind":"pith_short_12","alias_value":"I4XQNNPFLFLG","created_at":"2026-07-05T03:39:41Z"},{"alias_kind":"pith_short_16","alias_value":"I4XQNNPFLFLGU4BJ","created_at":"2026-07-05T03:39:41Z"},{"alias_kind":"pith_short_8","alias_value":"I4XQNNPF","created_at":"2026-07-05T03:39:41Z"}],"graph_snapshots":[{"event_id":"sha256:e6d775b3cd9f24180a6305f6410db174aa20884618948152f19af0a0cc7e9598","target":"graph","created_at":"2026-07-05T03:39:41Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2112.05416/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Amirhossein Kardoost, Margret Keuper, Sebastian Ziegler, Steffen Jung","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2021-12-10T09:48:03Z","title":"Optimizing Edge Detection for Image Segmentation with Multicut Penalties"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.05416","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:1a55f847a835ff5a09dc8c2aae335379710e266d6f8a96cd20a46f82126dc67e","target":"record","created_at":"2026-07-05T03:39:41Z","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":"a7795823fb609d693a74a2776c20f2c5820d6b285db1dec97001c25e5ff74127","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2021-12-10T09:48:03Z","title_canon_sha256":"bfae23438b5b85d3a53869969967fc55a01e0db21e05d4a2c68e761103135c3d"},"schema_version":"1.0","source":{"id":"2112.05416","kind":"arxiv","version":1}},"canonical_sha256":"472f06b5e559566a7029236a4225fd8e9d4664f578543fac4d6672ca865b000e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"472f06b5e559566a7029236a4225fd8e9d4664f578543fac4d6672ca865b000e","first_computed_at":"2026-07-05T03:39:41.126974Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:39:41.126974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CoJTLlqu5HsgKbmj+GqBUMQBeP0SYo1zNzXXurnxZBeA1T4oDm9WX4TBAZA+fdZSqF9M7OXDhdpWCRy6yb/+Bg==","signature_status":"signed_v1","signed_at":"2026-07-05T03:39:41.127380Z","signed_message":"canonical_sha256_bytes"},"source_id":"2112.05416","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a55f847a835ff5a09dc8c2aae335379710e266d6f8a96cd20a46f82126dc67e","sha256:e6d775b3cd9f24180a6305f6410db174aa20884618948152f19af0a0cc7e9598"],"state_sha256":"b8f2eeebebb0bf53d2eb30b6b911687f06a14c7ec8f4a436213312a7ddf2f836"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wgkG3IW0huMovJ+uOFCC9n84FqtAm3Cgu62jU45GTgsFidfm7q6SIN9BrFMxZu7KtyOePEbQ3baoB6so8DzkAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T19:56:13.300058Z","bundle_sha256":"8b2847ade188e7f9cb92562e5a3e9c75f04f0e810859ea16493f606da8b59f90"}}