{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:6B352G2XCW7CVFON6HBQD6RYRL","short_pith_number":"pith:6B352G2X","schema_version":"1.0","canonical_sha256":"f077dd1b5715be2a95cdf1c301fa388aec91de7640fe5c0fd9876eacc5db4438","source":{"kind":"arxiv","id":"1606.06650","version":1},"attestation_state":"computed","paper":{"title":"3D U-Net: Learning Dense Volumetric Segmentation from Sparse Annotation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Ahmed Abdulkadir, Olaf Ronneberger, \\\"Ozg\\\"un \\c{C}i\\c{c}ek, Soeren S. Lienkamp, Thomas Brox","submitted_at":"2016-06-21T16:42:20Z","abstract_excerpt":"This paper introduces a network for volumetric segmentation that learns from sparsely annotated volumetric images. We outline two attractive use cases of this method: (1) In a semi-automated setup, the user annotates some slices in the volume to be segmented. The network learns from these sparse annotations and provides a dense 3D segmentation. (2) In a fully-automated setup, we assume that a representative, sparsely annotated training set exists. Trained on this data set, the network densely segments new volumetric images. The proposed network extends the previous u-net architecture from Ronn"},"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":"1606.06650","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-06-21T16:42:20Z","cross_cats_sorted":[],"title_canon_sha256":"6169114cebd80813f0ae9d335734313f127472cdd86dcb90df91247b678a92ab","abstract_canon_sha256":"21380dfa833b0cb7f7d37dac6cf837ee5cec882da8944e1a3c6358e050cb82e9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:09.047695Z","signature_b64":"KrQ2alrMvTKDgcweucZTLNT247Js6Kiw7W9wChYiLEPlJF+2N2oYaebYfU8KPT/KVCFmQYtN9KPto3467UxFCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f077dd1b5715be2a95cdf1c301fa388aec91de7640fe5c0fd9876eacc5db4438","last_reissued_at":"2026-05-18T01:12:09.047272Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:09.047272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"3D U-Net: Learning Dense Volumetric Segmentation from Sparse Annotation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Ahmed Abdulkadir, Olaf Ronneberger, \\\"Ozg\\\"un \\c{C}i\\c{c}ek, Soeren S. Lienkamp, Thomas Brox","submitted_at":"2016-06-21T16:42:20Z","abstract_excerpt":"This paper introduces a network for volumetric segmentation that learns from sparsely annotated volumetric images. We outline two attractive use cases of this method: (1) In a semi-automated setup, the user annotates some slices in the volume to be segmented. The network learns from these sparse annotations and provides a dense 3D segmentation. (2) In a fully-automated setup, we assume that a representative, sparsely annotated training set exists. Trained on this data set, the network densely segments new volumetric images. The proposed network extends the previous u-net architecture from Ronn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.06650","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":"1606.06650","created_at":"2026-05-18T01:12:09.047351+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.06650v1","created_at":"2026-05-18T01:12:09.047351+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.06650","created_at":"2026-05-18T01:12:09.047351+00:00"},{"alias_kind":"pith_short_12","alias_value":"6B352G2XCW7C","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"6B352G2XCW7CVFON","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"6B352G2X","created_at":"2026-05-18T12:30:01.593930+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"1907.02003","citing_title":"Anatomically Consistent Segmentation of Organs at Risk in MRI with Convolutional Neural Networks","ref_index":10,"is_internal_anchor":true},{"citing_arxiv_id":"2605.22489","citing_title":"Machine Learning Techniques for Astrophysics and Cosmology: Lyman-$\\alpha$ forest","ref_index":184,"is_internal_anchor":true},{"citing_arxiv_id":"2512.15369","citing_title":"SemanticBridge - A Dataset for 3D Semantic Segmentation of Bridges and Domain Gap Analysis","ref_index":44,"is_internal_anchor":true},{"citing_arxiv_id":"2604.18713","citing_title":"Align then Refine: Text-Guided 3D Prostate Lesion Segmentation","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6B352G2XCW7CVFON6HBQD6RYRL","json":"https://pith.science/pith/6B352G2XCW7CVFON6HBQD6RYRL.json","graph_json":"https://pith.science/api/pith-number/6B352G2XCW7CVFON6HBQD6RYRL/graph.json","events_json":"https://pith.science/api/pith-number/6B352G2XCW7CVFON6HBQD6RYRL/events.json","paper":"https://pith.science/paper/6B352G2X"},"agent_actions":{"view_html":"https://pith.science/pith/6B352G2XCW7CVFON6HBQD6RYRL","download_json":"https://pith.science/pith/6B352G2XCW7CVFON6HBQD6RYRL.json","view_paper":"https://pith.science/paper/6B352G2X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.06650&json=true","fetch_graph":"https://pith.science/api/pith-number/6B352G2XCW7CVFON6HBQD6RYRL/graph.json","fetch_events":"https://pith.science/api/pith-number/6B352G2XCW7CVFON6HBQD6RYRL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6B352G2XCW7CVFON6HBQD6RYRL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6B352G2XCW7CVFON6HBQD6RYRL/action/storage_attestation","attest_author":"https://pith.science/pith/6B352G2XCW7CVFON6HBQD6RYRL/action/author_attestation","sign_citation":"https://pith.science/pith/6B352G2XCW7CVFON6HBQD6RYRL/action/citation_signature","submit_replication":"https://pith.science/pith/6B352G2XCW7CVFON6HBQD6RYRL/action/replication_record"}},"created_at":"2026-05-18T01:12:09.047351+00:00","updated_at":"2026-05-18T01:12:09.047351+00:00"}