{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BSKV5ISKIXBLBI2SXHOV2FF5VK","short_pith_number":"pith:BSKV5ISK","schema_version":"1.0","canonical_sha256":"0c955ea24a45c2b0a352b9dd5d14bdaa903de534978493cfa0a33e65d122ce75","source":{"kind":"arxiv","id":"1707.00907","version":1},"attestation_state":"computed","paper":{"title":"The Candidate Multi-Cut for Cell Segmentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Chong Zhang, Jan Funke, Stephan Saalfeld, Tobias Pietzsch","submitted_at":"2017-07-04T11:05:40Z","abstract_excerpt":"Two successful approaches for the segmentation of biomedical images are (1) the selection of segment candidates from a merge-tree, and (2) the clustering of small superpixels by solving a Multi-Cut problem. In this paper, we introduce a model that unifies both approaches. Our model, the Candidate Multi-Cut (CMC), allows joint selection and clustering of segment candidates from a merge-tree. This way, we overcome the respective limitations of the individual methods: (1) the space of possible segmentations is not constrained to candidates of a merge-tree, and (2) the decision for clustering can "},"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":"1707.00907","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-07-04T11:05:40Z","cross_cats_sorted":[],"title_canon_sha256":"51757470c0bb21d08d026f85c311821f6ccf54910eabbe4a1cabf18510fc43b9","abstract_canon_sha256":"871aef7f719147d1bff65f07856a7d98451397bd1467a03f80dac7132d2818dd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:56.671777Z","signature_b64":"V9JRZ4SOaYuXQLigjzkmVUsUWAvtMkHSyTScNZuO6E9NVZvhiWPf9ty+7dE/ONRgLoKesqbKVYjScga9kpWkAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c955ea24a45c2b0a352b9dd5d14bdaa903de534978493cfa0a33e65d122ce75","last_reissued_at":"2026-05-18T00:40:56.671123Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:56.671123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Candidate Multi-Cut for Cell Segmentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Chong Zhang, Jan Funke, Stephan Saalfeld, Tobias Pietzsch","submitted_at":"2017-07-04T11:05:40Z","abstract_excerpt":"Two successful approaches for the segmentation of biomedical images are (1) the selection of segment candidates from a merge-tree, and (2) the clustering of small superpixels by solving a Multi-Cut problem. In this paper, we introduce a model that unifies both approaches. Our model, the Candidate Multi-Cut (CMC), allows joint selection and clustering of segment candidates from a merge-tree. This way, we overcome the respective limitations of the individual methods: (1) the space of possible segmentations is not constrained to candidates of a merge-tree, and (2) the decision for clustering can "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.00907","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":"1707.00907","created_at":"2026-05-18T00:40:56.671224+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.00907v1","created_at":"2026-05-18T00:40:56.671224+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.00907","created_at":"2026-05-18T00:40:56.671224+00:00"},{"alias_kind":"pith_short_12","alias_value":"BSKV5ISKIXBL","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"BSKV5ISKIXBLBI2S","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"BSKV5ISK","created_at":"2026-05-18T12:31:08.081275+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/BSKV5ISKIXBLBI2SXHOV2FF5VK","json":"https://pith.science/pith/BSKV5ISKIXBLBI2SXHOV2FF5VK.json","graph_json":"https://pith.science/api/pith-number/BSKV5ISKIXBLBI2SXHOV2FF5VK/graph.json","events_json":"https://pith.science/api/pith-number/BSKV5ISKIXBLBI2SXHOV2FF5VK/events.json","paper":"https://pith.science/paper/BSKV5ISK"},"agent_actions":{"view_html":"https://pith.science/pith/BSKV5ISKIXBLBI2SXHOV2FF5VK","download_json":"https://pith.science/pith/BSKV5ISKIXBLBI2SXHOV2FF5VK.json","view_paper":"https://pith.science/paper/BSKV5ISK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.00907&json=true","fetch_graph":"https://pith.science/api/pith-number/BSKV5ISKIXBLBI2SXHOV2FF5VK/graph.json","fetch_events":"https://pith.science/api/pith-number/BSKV5ISKIXBLBI2SXHOV2FF5VK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BSKV5ISKIXBLBI2SXHOV2FF5VK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BSKV5ISKIXBLBI2SXHOV2FF5VK/action/storage_attestation","attest_author":"https://pith.science/pith/BSKV5ISKIXBLBI2SXHOV2FF5VK/action/author_attestation","sign_citation":"https://pith.science/pith/BSKV5ISKIXBLBI2SXHOV2FF5VK/action/citation_signature","submit_replication":"https://pith.science/pith/BSKV5ISKIXBLBI2SXHOV2FF5VK/action/replication_record"}},"created_at":"2026-05-18T00:40:56.671224+00:00","updated_at":"2026-05-18T00:40:56.671224+00:00"}