{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:X4RT5YDTUTLTTIY2MOXZYGWCXM","short_pith_number":"pith:X4RT5YDT","schema_version":"1.0","canonical_sha256":"bf233ee073a4d739a31a63af9c1ac2bb18ba1496c04090fca364b642fb1a77af","source":{"kind":"arxiv","id":"2312.05176","version":2},"attestation_state":"computed","paper":{"title":"MRI Scan Synthesis Methods based on Clustering and Pix2Pix","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.LG"],"primary_cat":"eess.IV","authors_text":"Charlotte Z\\\"aske, Giulia Baldini, Liliana L. Caldeira, Melanie Schmidt","submitted_at":"2023-12-08T16:59:17Z","abstract_excerpt":"We consider a missing data problem in the context of automatic segmentation methods for Magnetic Resonance Imaging (MRI) brain scans. Usually, automated MRI scan segmentation is based on multiple scans (e.g., T1-weighted, T2-weighted, T1CE, FLAIR). However, quite often a scan is blurry, missing or otherwise unusable. We investigate the question whether a missing scan can be synthesized. We exemplify that this is in principle possible by synthesizing a T2-weighted scan from a given T1-weighted scan. Our first aim is to compute a picture that resembles the missing scan closely, measured by avera"},"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":"2312.05176","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.IV","submitted_at":"2023-12-08T16:59:17Z","cross_cats_sorted":["cs.CV","cs.LG"],"title_canon_sha256":"7994a41f21d772bdcc9dcc0dd9d3196b35d8769b7c5d099a726ed5394ae085ab","abstract_canon_sha256":"02a043ba689fcf83eb89ea0bbb41807ce8c62184c094e3c58f5a26086de2d078"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:14:51.982930Z","signature_b64":"BdCGZLmueFfAdUhlcLsVoPDLa42fXGyG9SC174ZaGqVqsgBuuy59RWBNgXK01Hxkwbj+7z+MjdRvVSi1wRebDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf233ee073a4d739a31a63af9c1ac2bb18ba1496c04090fca364b642fb1a77af","last_reissued_at":"2026-07-05T08:14:51.982490Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:14:51.982490Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MRI Scan Synthesis Methods based on Clustering and Pix2Pix","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.LG"],"primary_cat":"eess.IV","authors_text":"Charlotte Z\\\"aske, Giulia Baldini, Liliana L. Caldeira, Melanie Schmidt","submitted_at":"2023-12-08T16:59:17Z","abstract_excerpt":"We consider a missing data problem in the context of automatic segmentation methods for Magnetic Resonance Imaging (MRI) brain scans. Usually, automated MRI scan segmentation is based on multiple scans (e.g., T1-weighted, T2-weighted, T1CE, FLAIR). However, quite often a scan is blurry, missing or otherwise unusable. We investigate the question whether a missing scan can be synthesized. We exemplify that this is in principle possible by synthesizing a T2-weighted scan from a given T1-weighted scan. Our first aim is to compute a picture that resembles the missing scan closely, measured by avera"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.05176","kind":"arxiv","version":2},"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/2312.05176/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":"2312.05176","created_at":"2026-07-05T08:14:51.982550+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.05176v2","created_at":"2026-07-05T08:14:51.982550+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.05176","created_at":"2026-07-05T08:14:51.982550+00:00"},{"alias_kind":"pith_short_12","alias_value":"X4RT5YDTUTLT","created_at":"2026-07-05T08:14:51.982550+00:00"},{"alias_kind":"pith_short_16","alias_value":"X4RT5YDTUTLTTIY2","created_at":"2026-07-05T08:14:51.982550+00:00"},{"alias_kind":"pith_short_8","alias_value":"X4RT5YDT","created_at":"2026-07-05T08:14:51.982550+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.08460","citing_title":"F3-Net: Foundation Model for Full Abnormality Segmentation of Medical Images with Flexible Input Modality Requirement","ref_index":46,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/X4RT5YDTUTLTTIY2MOXZYGWCXM","json":"https://pith.science/pith/X4RT5YDTUTLTTIY2MOXZYGWCXM.json","graph_json":"https://pith.science/api/pith-number/X4RT5YDTUTLTTIY2MOXZYGWCXM/graph.json","events_json":"https://pith.science/api/pith-number/X4RT5YDTUTLTTIY2MOXZYGWCXM/events.json","paper":"https://pith.science/paper/X4RT5YDT"},"agent_actions":{"view_html":"https://pith.science/pith/X4RT5YDTUTLTTIY2MOXZYGWCXM","download_json":"https://pith.science/pith/X4RT5YDTUTLTTIY2MOXZYGWCXM.json","view_paper":"https://pith.science/paper/X4RT5YDT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.05176&json=true","fetch_graph":"https://pith.science/api/pith-number/X4RT5YDTUTLTTIY2MOXZYGWCXM/graph.json","fetch_events":"https://pith.science/api/pith-number/X4RT5YDTUTLTTIY2MOXZYGWCXM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X4RT5YDTUTLTTIY2MOXZYGWCXM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X4RT5YDTUTLTTIY2MOXZYGWCXM/action/storage_attestation","attest_author":"https://pith.science/pith/X4RT5YDTUTLTTIY2MOXZYGWCXM/action/author_attestation","sign_citation":"https://pith.science/pith/X4RT5YDTUTLTTIY2MOXZYGWCXM/action/citation_signature","submit_replication":"https://pith.science/pith/X4RT5YDTUTLTTIY2MOXZYGWCXM/action/replication_record"}},"created_at":"2026-07-05T08:14:51.982550+00:00","updated_at":"2026-07-05T08:14:51.982550+00:00"}