{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:EEBW5VZXLALBUL7OU5QT3SLKL7","short_pith_number":"pith:EEBW5VZX","schema_version":"1.0","canonical_sha256":"21036ed73758161a2feea7613dc96a5fe181a6e7ee4c03e65374a59bbf5a3d69","source":{"kind":"arxiv","id":"2004.06688","version":2},"attestation_state":"computed","paper":{"title":"End-to-End Variational Networks for Accelerated MRI Reconstruction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"eess.IV","authors_text":"Aaron Defazio, Anuroop Sriram, C. Lawrence Zitnick, Florian Knoll, Jure Zbontar, Nafissa Yakubova, Patricia Johnson, Tullie Murrell","submitted_at":"2020-04-14T17:42:13Z","abstract_excerpt":"The slow acquisition speed of magnetic resonance imaging (MRI) has led to the development of two complementary methods: acquiring multiple views of the anatomy simultaneously (parallel imaging) and acquiring fewer samples than necessary for traditional signal processing methods (compressed sensing). While the combination of these methods has the potential to allow much faster scan times, reconstruction from such undersampled multi-coil data has remained an open problem. In this paper, we present a new approach to this problem that extends previously proposed variational methods by learning ful"},"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":"2004.06688","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.IV","submitted_at":"2020-04-14T17:42:13Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"41e953faa3f53f0f5b65b1c2c73b1be8e4fffa0c500854ee2bfb43e492d51085","abstract_canon_sha256":"98c74b503158a72d5ecd8d918b1ea4a84ea865a3ff6ba430a263f109cdf0347f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:55:21.351010Z","signature_b64":"JTOnl54U/sq1IvzycLgqzgWIKG+4dWmWc590iYvQomLCwVJY5u66aRwPB6VVDo7qgUhgvY27t4YQvt3rikllDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21036ed73758161a2feea7613dc96a5fe181a6e7ee4c03e65374a59bbf5a3d69","last_reissued_at":"2026-07-05T00:55:21.350509Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:55:21.350509Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"End-to-End Variational Networks for Accelerated MRI Reconstruction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"eess.IV","authors_text":"Aaron Defazio, Anuroop Sriram, C. Lawrence Zitnick, Florian Knoll, Jure Zbontar, Nafissa Yakubova, Patricia Johnson, Tullie Murrell","submitted_at":"2020-04-14T17:42:13Z","abstract_excerpt":"The slow acquisition speed of magnetic resonance imaging (MRI) has led to the development of two complementary methods: acquiring multiple views of the anatomy simultaneously (parallel imaging) and acquiring fewer samples than necessary for traditional signal processing methods (compressed sensing). While the combination of these methods has the potential to allow much faster scan times, reconstruction from such undersampled multi-coil data has remained an open problem. In this paper, we present a new approach to this problem that extends previously proposed variational methods by learning ful"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.06688","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/2004.06688/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":"2004.06688","created_at":"2026-07-05T00:55:21.350567+00:00"},{"alias_kind":"arxiv_version","alias_value":"2004.06688v2","created_at":"2026-07-05T00:55:21.350567+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.06688","created_at":"2026-07-05T00:55:21.350567+00:00"},{"alias_kind":"pith_short_12","alias_value":"EEBW5VZXLALB","created_at":"2026-07-05T00:55:21.350567+00:00"},{"alias_kind":"pith_short_16","alias_value":"EEBW5VZXLALBUL7O","created_at":"2026-07-05T00:55:21.350567+00:00"},{"alias_kind":"pith_short_8","alias_value":"EEBW5VZX","created_at":"2026-07-05T00:55:21.350567+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.19182","citing_title":"Optimized Multi-Contrast Self-Supervised MRI Reconstruction using Learned k-space Partitioning","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2606.01784","citing_title":"MoRE: A Mixture-of-Experts-Based Task-Adaptive End-to-End Network for Multimodal MRI Reconstruction","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EEBW5VZXLALBUL7OU5QT3SLKL7","json":"https://pith.science/pith/EEBW5VZXLALBUL7OU5QT3SLKL7.json","graph_json":"https://pith.science/api/pith-number/EEBW5VZXLALBUL7OU5QT3SLKL7/graph.json","events_json":"https://pith.science/api/pith-number/EEBW5VZXLALBUL7OU5QT3SLKL7/events.json","paper":"https://pith.science/paper/EEBW5VZX"},"agent_actions":{"view_html":"https://pith.science/pith/EEBW5VZXLALBUL7OU5QT3SLKL7","download_json":"https://pith.science/pith/EEBW5VZXLALBUL7OU5QT3SLKL7.json","view_paper":"https://pith.science/paper/EEBW5VZX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2004.06688&json=true","fetch_graph":"https://pith.science/api/pith-number/EEBW5VZXLALBUL7OU5QT3SLKL7/graph.json","fetch_events":"https://pith.science/api/pith-number/EEBW5VZXLALBUL7OU5QT3SLKL7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EEBW5VZXLALBUL7OU5QT3SLKL7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EEBW5VZXLALBUL7OU5QT3SLKL7/action/storage_attestation","attest_author":"https://pith.science/pith/EEBW5VZXLALBUL7OU5QT3SLKL7/action/author_attestation","sign_citation":"https://pith.science/pith/EEBW5VZXLALBUL7OU5QT3SLKL7/action/citation_signature","submit_replication":"https://pith.science/pith/EEBW5VZXLALBUL7OU5QT3SLKL7/action/replication_record"}},"created_at":"2026-07-05T00:55:21.350567+00:00","updated_at":"2026-07-05T00:55:21.350567+00:00"}