{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:IKAHPLALLYRDU6I2MOLFMS26DU","short_pith_number":"pith:IKAHPLAL","schema_version":"1.0","canonical_sha256":"428077ac0b5e223a791a6396564b5e1d0c74e9c595e1072bf3b5bbf51bad5873","source":{"kind":"arxiv","id":"2208.10791","version":1},"attestation_state":"computed","paper":{"title":"Extending nnU-Net is all you need","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"eess.IV","authors_text":"Constantin Ulrich, Fabian Isensee, Klaus H. Maier-Hein, Tassilo Wald","submitted_at":"2022-08-23T07:54:29Z","abstract_excerpt":"Semantic segmentation is one of the most popular research areas in medical image computing. Perhaps surprisingly, despite its conceptualization dating back to 2018, nnU-Net continues to provide competitive out-of-the-box solutions for a broad variety of segmentation problems and is regularly used as a development framework for challenge-winning algorithms. Here we use nnU-Net to participate in the AMOS2022 challenge, which comes with a unique set of tasks: not only is the dataset one of the largest ever created and boasts 15 target structures, but the competition also requires submitted soluti"},"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":"2208.10791","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.IV","submitted_at":"2022-08-23T07:54:29Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"4a57dba835ff87602fd1610d5f667790ac17ab72393e21edf7d1c56ae817041e","abstract_canon_sha256":"0c9004a9f9baf8919bf260fbb96eff0da26b1f8381a8ab0939ab8a79ee4f74b1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:50:40.295414Z","signature_b64":"MACxhvNBkSb2/jr5hfsUmXTHQ5is7fsJmfKFFTSHlbkaNNKKY3WjNnRIauDX67mGgqO19SNojXsYCVGBbopWAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"428077ac0b5e223a791a6396564b5e1d0c74e9c595e1072bf3b5bbf51bad5873","last_reissued_at":"2026-07-05T04:50:40.294918Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:50:40.294918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Extending nnU-Net is all you need","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"eess.IV","authors_text":"Constantin Ulrich, Fabian Isensee, Klaus H. Maier-Hein, Tassilo Wald","submitted_at":"2022-08-23T07:54:29Z","abstract_excerpt":"Semantic segmentation is one of the most popular research areas in medical image computing. Perhaps surprisingly, despite its conceptualization dating back to 2018, nnU-Net continues to provide competitive out-of-the-box solutions for a broad variety of segmentation problems and is regularly used as a development framework for challenge-winning algorithms. Here we use nnU-Net to participate in the AMOS2022 challenge, which comes with a unique set of tasks: not only is the dataset one of the largest ever created and boasts 15 target structures, but the competition also requires submitted soluti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.10791","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/2208.10791/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":"2208.10791","created_at":"2026-07-05T04:50:40.294976+00:00"},{"alias_kind":"arxiv_version","alias_value":"2208.10791v1","created_at":"2026-07-05T04:50:40.294976+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.10791","created_at":"2026-07-05T04:50:40.294976+00:00"},{"alias_kind":"pith_short_12","alias_value":"IKAHPLALLYRD","created_at":"2026-07-05T04:50:40.294976+00:00"},{"alias_kind":"pith_short_16","alias_value":"IKAHPLALLYRDU6I2","created_at":"2026-07-05T04:50:40.294976+00:00"},{"alias_kind":"pith_short_8","alias_value":"IKAHPLAL","created_at":"2026-07-05T04:50:40.294976+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.16393","citing_title":"Vision Transformer-Conditioned UNet for Domain-Adaptive Semantic Segmentation","ref_index":18,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IKAHPLALLYRDU6I2MOLFMS26DU","json":"https://pith.science/pith/IKAHPLALLYRDU6I2MOLFMS26DU.json","graph_json":"https://pith.science/api/pith-number/IKAHPLALLYRDU6I2MOLFMS26DU/graph.json","events_json":"https://pith.science/api/pith-number/IKAHPLALLYRDU6I2MOLFMS26DU/events.json","paper":"https://pith.science/paper/IKAHPLAL"},"agent_actions":{"view_html":"https://pith.science/pith/IKAHPLALLYRDU6I2MOLFMS26DU","download_json":"https://pith.science/pith/IKAHPLALLYRDU6I2MOLFMS26DU.json","view_paper":"https://pith.science/paper/IKAHPLAL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2208.10791&json=true","fetch_graph":"https://pith.science/api/pith-number/IKAHPLALLYRDU6I2MOLFMS26DU/graph.json","fetch_events":"https://pith.science/api/pith-number/IKAHPLALLYRDU6I2MOLFMS26DU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IKAHPLALLYRDU6I2MOLFMS26DU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IKAHPLALLYRDU6I2MOLFMS26DU/action/storage_attestation","attest_author":"https://pith.science/pith/IKAHPLALLYRDU6I2MOLFMS26DU/action/author_attestation","sign_citation":"https://pith.science/pith/IKAHPLALLYRDU6I2MOLFMS26DU/action/citation_signature","submit_replication":"https://pith.science/pith/IKAHPLALLYRDU6I2MOLFMS26DU/action/replication_record"}},"created_at":"2026-07-05T04:50:40.294976+00:00","updated_at":"2026-07-05T04:50:40.294976+00:00"}