{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:EKTCQXG7DQ6OZ3YP5TAL4D7SAR","short_pith_number":"pith:EKTCQXG7","schema_version":"1.0","canonical_sha256":"22a6285cdf1c3cecef0fecc0be0ff2046d32860ffc7283689adf8d40a7a3e14e","source":{"kind":"arxiv","id":"2005.11875","version":2},"attestation_state":"computed","paper":{"title":"Bayesian Conditional GAN for MRI Brain Image Synthesis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"eess.IV","authors_text":"Gengyan Zhao, Mary E. Meyerand, Rasmus M. Birn","submitted_at":"2020-05-25T00:58:23Z","abstract_excerpt":"As a powerful technique in medical imaging, image synthesis is widely used in applications such as denoising, super resolution and modality transformation etc. Recently, the revival of deep neural networks made immense progress in the field of medical imaging. Although many deep leaning based models have been proposed to improve the image synthesis accuracy, the evaluation of the model uncertainty, which is highly important for medical applications, has been a missing part. In this work, we propose to use Bayesian conditional generative adversarial network (GAN) with concrete dropout to improv"},"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":"2005.11875","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.IV","submitted_at":"2020-05-25T00:58:23Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"589795237c3724839baebdc8b3dea1190904d53e0044af69896d32f9be9173ea","abstract_canon_sha256":"a2ef14843ecd2aeae4e9f94c53b274e50427fd3df4d67790663b3331f0914b9a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:34:08.226901Z","signature_b64":"KFO553k75P49zwSoOX/wGeMWTbH3P12EzP5XXdkdFXmMQiq0nX24YNJWxmoA1HkR5+2V3P0UG7K7Xrp2n+pgBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22a6285cdf1c3cecef0fecc0be0ff2046d32860ffc7283689adf8d40a7a3e14e","last_reissued_at":"2026-07-05T02:34:08.226395Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:34:08.226395Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bayesian Conditional GAN for MRI Brain Image Synthesis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"eess.IV","authors_text":"Gengyan Zhao, Mary E. Meyerand, Rasmus M. Birn","submitted_at":"2020-05-25T00:58:23Z","abstract_excerpt":"As a powerful technique in medical imaging, image synthesis is widely used in applications such as denoising, super resolution and modality transformation etc. Recently, the revival of deep neural networks made immense progress in the field of medical imaging. Although many deep leaning based models have been proposed to improve the image synthesis accuracy, the evaluation of the model uncertainty, which is highly important for medical applications, has been a missing part. In this work, we propose to use Bayesian conditional generative adversarial network (GAN) with concrete dropout to improv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.11875","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/2005.11875/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":"2005.11875","created_at":"2026-07-05T02:34:08.226453+00:00"},{"alias_kind":"arxiv_version","alias_value":"2005.11875v2","created_at":"2026-07-05T02:34:08.226453+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.11875","created_at":"2026-07-05T02:34:08.226453+00:00"},{"alias_kind":"pith_short_12","alias_value":"EKTCQXG7DQ6O","created_at":"2026-07-05T02:34:08.226453+00:00"},{"alias_kind":"pith_short_16","alias_value":"EKTCQXG7DQ6OZ3YP","created_at":"2026-07-05T02:34:08.226453+00:00"},{"alias_kind":"pith_short_8","alias_value":"EKTCQXG7","created_at":"2026-07-05T02:34:08.226453+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.11366","citing_title":"Characterizing Nash Equilibria in Zero-Sum Games: A Physics-Inspired, Parallelizable Approach with a Linear Number of Gradient Queries","ref_index":32,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EKTCQXG7DQ6OZ3YP5TAL4D7SAR","json":"https://pith.science/pith/EKTCQXG7DQ6OZ3YP5TAL4D7SAR.json","graph_json":"https://pith.science/api/pith-number/EKTCQXG7DQ6OZ3YP5TAL4D7SAR/graph.json","events_json":"https://pith.science/api/pith-number/EKTCQXG7DQ6OZ3YP5TAL4D7SAR/events.json","paper":"https://pith.science/paper/EKTCQXG7"},"agent_actions":{"view_html":"https://pith.science/pith/EKTCQXG7DQ6OZ3YP5TAL4D7SAR","download_json":"https://pith.science/pith/EKTCQXG7DQ6OZ3YP5TAL4D7SAR.json","view_paper":"https://pith.science/paper/EKTCQXG7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2005.11875&json=true","fetch_graph":"https://pith.science/api/pith-number/EKTCQXG7DQ6OZ3YP5TAL4D7SAR/graph.json","fetch_events":"https://pith.science/api/pith-number/EKTCQXG7DQ6OZ3YP5TAL4D7SAR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EKTCQXG7DQ6OZ3YP5TAL4D7SAR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EKTCQXG7DQ6OZ3YP5TAL4D7SAR/action/storage_attestation","attest_author":"https://pith.science/pith/EKTCQXG7DQ6OZ3YP5TAL4D7SAR/action/author_attestation","sign_citation":"https://pith.science/pith/EKTCQXG7DQ6OZ3YP5TAL4D7SAR/action/citation_signature","submit_replication":"https://pith.science/pith/EKTCQXG7DQ6OZ3YP5TAL4D7SAR/action/replication_record"}},"created_at":"2026-07-05T02:34:08.226453+00:00","updated_at":"2026-07-05T02:34:08.226453+00:00"}