{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:TSLNLM7FWQZDQPE4UISCXN337I","short_pith_number":"pith:TSLNLM7F","schema_version":"1.0","canonical_sha256":"9c96d5b3e5b432383c9ca2242bb77bfa0f21067e168d35befebc180f4f2ce8fd","source":{"kind":"arxiv","id":"1906.11031","version":1},"attestation_state":"computed","paper":{"title":"Continuous Dice Coefficient: a Method for Evaluating Probabilistic Segmentations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.IV"],"primary_cat":"cs.CV","authors_text":"Guillermo Sapiro, Jinyoung Kim, Noam Harel, Reuben R Shamir, Yuval Duchin","submitted_at":"2019-06-26T12:35:00Z","abstract_excerpt":"Objective: Overlapping measures are often utilized to quantify the similarity between two binary regions. However, modern segmentation algorithms output a probability or confidence map with continuous values in the zero-to-one interval. Moreover, these binary overlapping measures are biased to structure size. Addressing these challenges is the objective of this work. Methods: We extend the definition of the classical Dice coefficient (DC) overlap to facilitate the direct comparison of a ground truth binary image with a probabilistic map. We call the extended method continuous Dice coefficient "},"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":"1906.11031","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-06-26T12:35:00Z","cross_cats_sorted":["eess.IV"],"title_canon_sha256":"4f6aca85d458ce28e56d49857a785502b02bd070b49a3264e5d96c6a602ecd52","abstract_canon_sha256":"5f2545cfe887a17688de9514cab48313f04e35043c7e3df5087e70dbcce464ac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:10.151673Z","signature_b64":"t2VY7Yp5eg3XFyxHj7GFmQFpooRK4561gR6NKpAaRRKja4B/j88ETC8dnoVgAwHGMroO8xGwS1aEQULYEY3/Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c96d5b3e5b432383c9ca2242bb77bfa0f21067e168d35befebc180f4f2ce8fd","last_reissued_at":"2026-05-17T23:42:10.151061Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:10.151061Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Continuous Dice Coefficient: a Method for Evaluating Probabilistic Segmentations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.IV"],"primary_cat":"cs.CV","authors_text":"Guillermo Sapiro, Jinyoung Kim, Noam Harel, Reuben R Shamir, Yuval Duchin","submitted_at":"2019-06-26T12:35:00Z","abstract_excerpt":"Objective: Overlapping measures are often utilized to quantify the similarity between two binary regions. However, modern segmentation algorithms output a probability or confidence map with continuous values in the zero-to-one interval. Moreover, these binary overlapping measures are biased to structure size. Addressing these challenges is the objective of this work. Methods: We extend the definition of the classical Dice coefficient (DC) overlap to facilitate the direct comparison of a ground truth binary image with a probabilistic map. We call the extended method continuous Dice coefficient "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.11031","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":"1906.11031","created_at":"2026-05-17T23:42:10.151170+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.11031v1","created_at":"2026-05-17T23:42:10.151170+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.11031","created_at":"2026-05-17T23:42:10.151170+00:00"},{"alias_kind":"pith_short_12","alias_value":"TSLNLM7FWQZD","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"TSLNLM7FWQZDQPE4","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"TSLNLM7F","created_at":"2026-05-18T12:33:30.264802+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.16792","citing_title":"From Diffusion to Resolution: Leveraging 2D Diffusion Models for 3D Super-Resolution Task","ref_index":40,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TSLNLM7FWQZDQPE4UISCXN337I","json":"https://pith.science/pith/TSLNLM7FWQZDQPE4UISCXN337I.json","graph_json":"https://pith.science/api/pith-number/TSLNLM7FWQZDQPE4UISCXN337I/graph.json","events_json":"https://pith.science/api/pith-number/TSLNLM7FWQZDQPE4UISCXN337I/events.json","paper":"https://pith.science/paper/TSLNLM7F"},"agent_actions":{"view_html":"https://pith.science/pith/TSLNLM7FWQZDQPE4UISCXN337I","download_json":"https://pith.science/pith/TSLNLM7FWQZDQPE4UISCXN337I.json","view_paper":"https://pith.science/paper/TSLNLM7F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.11031&json=true","fetch_graph":"https://pith.science/api/pith-number/TSLNLM7FWQZDQPE4UISCXN337I/graph.json","fetch_events":"https://pith.science/api/pith-number/TSLNLM7FWQZDQPE4UISCXN337I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TSLNLM7FWQZDQPE4UISCXN337I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TSLNLM7FWQZDQPE4UISCXN337I/action/storage_attestation","attest_author":"https://pith.science/pith/TSLNLM7FWQZDQPE4UISCXN337I/action/author_attestation","sign_citation":"https://pith.science/pith/TSLNLM7FWQZDQPE4UISCXN337I/action/citation_signature","submit_replication":"https://pith.science/pith/TSLNLM7FWQZDQPE4UISCXN337I/action/replication_record"}},"created_at":"2026-05-17T23:42:10.151170+00:00","updated_at":"2026-05-17T23:42:10.151170+00:00"}