{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:RTWKJNR2YC66SJ6PQUSNCKOFYB","short_pith_number":"pith:RTWKJNR2","schema_version":"1.0","canonical_sha256":"8ceca4b63ac0bde927cf8524d129c5c058dc1366286ff49d17532924b1232fb7","source":{"kind":"arxiv","id":"1908.02426","version":1},"attestation_state":"computed","paper":{"title":"Model Learning: Primal Dual Networks for Fast MR imaging","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.LG","physics.med-ph","stat.ML"],"primary_cat":"eess.IV","authors_text":"Dong Liang, HaiFeng Wang, Jing Cheng, Leslie Ying","submitted_at":"2019-08-07T02:59:08Z","abstract_excerpt":"Magnetic resonance imaging (MRI) is known to be a slow imaging modality and undersampling in k-space has been used to increase the imaging speed. However, image reconstruction from undersampled k-space data is an ill-posed inverse problem. Iterative algorithms based on compressed sensing have been used to address the issue. In this work, we unroll the iterations of the primal-dual hybrid gradient algorithm to a learnable deep network architecture, and gradually relax the constraints to reconstruct MR images from highly undersampled k-space data. The proposed method combines the theoretical con"},"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":"1908.02426","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.IV","submitted_at":"2019-08-07T02:59:08Z","cross_cats_sorted":["cs.CV","cs.LG","physics.med-ph","stat.ML"],"title_canon_sha256":"bbab610c929d429627e039067f58c7cd971a820600b4a5317abc65e92d9fe544","abstract_canon_sha256":"63dc27cf1b2ce6406b44ef53a84f5c3c265d447a13bec5834b67323aadd6373b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:52:08.815652Z","signature_b64":"qwdKD3652zycJyTKUrVcIlqRg+o6CTBNd84DWSOum/EajATHWKBFr0jH5Athf0G07leAw7Li8TeJl40byRiKCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ceca4b63ac0bde927cf8524d129c5c058dc1366286ff49d17532924b1232fb7","last_reissued_at":"2026-07-04T23:52:08.815197Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:52:08.815197Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Model Learning: Primal Dual Networks for Fast MR imaging","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.LG","physics.med-ph","stat.ML"],"primary_cat":"eess.IV","authors_text":"Dong Liang, HaiFeng Wang, Jing Cheng, Leslie Ying","submitted_at":"2019-08-07T02:59:08Z","abstract_excerpt":"Magnetic resonance imaging (MRI) is known to be a slow imaging modality and undersampling in k-space has been used to increase the imaging speed. However, image reconstruction from undersampled k-space data is an ill-posed inverse problem. Iterative algorithms based on compressed sensing have been used to address the issue. In this work, we unroll the iterations of the primal-dual hybrid gradient algorithm to a learnable deep network architecture, and gradually relax the constraints to reconstruct MR images from highly undersampled k-space data. The proposed method combines the theoretical con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.02426","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/1908.02426/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":"1908.02426","created_at":"2026-07-04T23:52:08.815255+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.02426v1","created_at":"2026-07-04T23:52:08.815255+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.02426","created_at":"2026-07-04T23:52:08.815255+00:00"},{"alias_kind":"pith_short_12","alias_value":"RTWKJNR2YC66","created_at":"2026-07-04T23:52:08.815255+00:00"},{"alias_kind":"pith_short_16","alias_value":"RTWKJNR2YC66SJ6P","created_at":"2026-07-04T23:52:08.815255+00:00"},{"alias_kind":"pith_short_8","alias_value":"RTWKJNR2","created_at":"2026-07-04T23:52:08.815255+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RTWKJNR2YC66SJ6PQUSNCKOFYB","json":"https://pith.science/pith/RTWKJNR2YC66SJ6PQUSNCKOFYB.json","graph_json":"https://pith.science/api/pith-number/RTWKJNR2YC66SJ6PQUSNCKOFYB/graph.json","events_json":"https://pith.science/api/pith-number/RTWKJNR2YC66SJ6PQUSNCKOFYB/events.json","paper":"https://pith.science/paper/RTWKJNR2"},"agent_actions":{"view_html":"https://pith.science/pith/RTWKJNR2YC66SJ6PQUSNCKOFYB","download_json":"https://pith.science/pith/RTWKJNR2YC66SJ6PQUSNCKOFYB.json","view_paper":"https://pith.science/paper/RTWKJNR2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.02426&json=true","fetch_graph":"https://pith.science/api/pith-number/RTWKJNR2YC66SJ6PQUSNCKOFYB/graph.json","fetch_events":"https://pith.science/api/pith-number/RTWKJNR2YC66SJ6PQUSNCKOFYB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RTWKJNR2YC66SJ6PQUSNCKOFYB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RTWKJNR2YC66SJ6PQUSNCKOFYB/action/storage_attestation","attest_author":"https://pith.science/pith/RTWKJNR2YC66SJ6PQUSNCKOFYB/action/author_attestation","sign_citation":"https://pith.science/pith/RTWKJNR2YC66SJ6PQUSNCKOFYB/action/citation_signature","submit_replication":"https://pith.science/pith/RTWKJNR2YC66SJ6PQUSNCKOFYB/action/replication_record"}},"created_at":"2026-07-04T23:52:08.815255+00:00","updated_at":"2026-07-04T23:52:08.815255+00:00"}