{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:MGYM3ZHMXCWRPQJBJOVNT3UADZ","short_pith_number":"pith:MGYM3ZHM","schema_version":"1.0","canonical_sha256":"61b0cde4ecb8ad17c1214baad9ee801e5215310d837903ffb9f9062635df3360","source":{"kind":"arxiv","id":"1706.00051","version":1},"attestation_state":"computed","paper":{"title":"Deep Generative Adversarial Networks for Compressed Sensing Automates MRI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.CV","authors_text":"Enhao Gong, Greg Zaharchuk, John M. Pauly, Joseph Y. Cheng, Lei Xing, Marcus Alley, Morteza Mardani, Neil Thakur, Shreyas Vasanawala, Song Han, William Dally","submitted_at":"2017-05-31T19:12:14Z","abstract_excerpt":"Magnetic resonance image (MRI) reconstruction is a severely ill-posed linear inverse task demanding time and resource intensive computations that can substantially trade off {\\it accuracy} for {\\it speed} in real-time imaging. In addition, state-of-the-art compressed sensing (CS) analytics are not cognizant of the image {\\it diagnostic quality}. To cope with these challenges we put forth a novel CS framework that permeates benefits from generative adversarial networks (GAN) to train a (low-dimensional) manifold of diagnostic-quality MR images from historical patients. Leveraging a mixture of l"},"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":"1706.00051","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-05-31T19:12:14Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"23a83e2feffaae962798543d0f1711a9f11bbbef9b67a83c160efe3be43ff059","abstract_canon_sha256":"4185cb1c7d206fa2eb19b984866a7ab7750846173f5c0fc0a99934ee0ff33e6d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:15.220508Z","signature_b64":"C8Neb3IH8bMgpNC3ySDruQQ3nK4UiH4KgJOvkJIbFzk8j/Am9mjR516LENWBK+7tMFVtXOugHAJh2WPdmA1hCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61b0cde4ecb8ad17c1214baad9ee801e5215310d837903ffb9f9062635df3360","last_reissued_at":"2026-05-18T00:43:15.219920Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:15.219920Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deep Generative Adversarial Networks for Compressed Sensing Automates MRI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.CV","authors_text":"Enhao Gong, Greg Zaharchuk, John M. Pauly, Joseph Y. Cheng, Lei Xing, Marcus Alley, Morteza Mardani, Neil Thakur, Shreyas Vasanawala, Song Han, William Dally","submitted_at":"2017-05-31T19:12:14Z","abstract_excerpt":"Magnetic resonance image (MRI) reconstruction is a severely ill-posed linear inverse task demanding time and resource intensive computations that can substantially trade off {\\it accuracy} for {\\it speed} in real-time imaging. In addition, state-of-the-art compressed sensing (CS) analytics are not cognizant of the image {\\it diagnostic quality}. To cope with these challenges we put forth a novel CS framework that permeates benefits from generative adversarial networks (GAN) to train a (low-dimensional) manifold of diagnostic-quality MR images from historical patients. Leveraging a mixture of l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.00051","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":"1706.00051","created_at":"2026-05-18T00:43:15.220037+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.00051v1","created_at":"2026-05-18T00:43:15.220037+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.00051","created_at":"2026-05-18T00:43:15.220037+00:00"},{"alias_kind":"pith_short_12","alias_value":"MGYM3ZHMXCWR","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"MGYM3ZHMXCWRPQJB","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"MGYM3ZHM","created_at":"2026-05-18T12:31:31.346846+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.09799","citing_title":"Scan-Adaptive MRI Undersampling Using Neighbor-based Optimization (SUNO)","ref_index":27,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MGYM3ZHMXCWRPQJBJOVNT3UADZ","json":"https://pith.science/pith/MGYM3ZHMXCWRPQJBJOVNT3UADZ.json","graph_json":"https://pith.science/api/pith-number/MGYM3ZHMXCWRPQJBJOVNT3UADZ/graph.json","events_json":"https://pith.science/api/pith-number/MGYM3ZHMXCWRPQJBJOVNT3UADZ/events.json","paper":"https://pith.science/paper/MGYM3ZHM"},"agent_actions":{"view_html":"https://pith.science/pith/MGYM3ZHMXCWRPQJBJOVNT3UADZ","download_json":"https://pith.science/pith/MGYM3ZHMXCWRPQJBJOVNT3UADZ.json","view_paper":"https://pith.science/paper/MGYM3ZHM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.00051&json=true","fetch_graph":"https://pith.science/api/pith-number/MGYM3ZHMXCWRPQJBJOVNT3UADZ/graph.json","fetch_events":"https://pith.science/api/pith-number/MGYM3ZHMXCWRPQJBJOVNT3UADZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MGYM3ZHMXCWRPQJBJOVNT3UADZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MGYM3ZHMXCWRPQJBJOVNT3UADZ/action/storage_attestation","attest_author":"https://pith.science/pith/MGYM3ZHMXCWRPQJBJOVNT3UADZ/action/author_attestation","sign_citation":"https://pith.science/pith/MGYM3ZHMXCWRPQJBJOVNT3UADZ/action/citation_signature","submit_replication":"https://pith.science/pith/MGYM3ZHMXCWRPQJBJOVNT3UADZ/action/replication_record"}},"created_at":"2026-05-18T00:43:15.220037+00:00","updated_at":"2026-05-18T00:43:15.220037+00:00"}