{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:EUZNJGVVLAVX27OUAM36OGCIGO","short_pith_number":"pith:EUZNJGVV","schema_version":"1.0","canonical_sha256":"2532d49ab5582b7d7dd40337e71848339f27f2f965370b09408771c0749000b8","source":{"kind":"arxiv","id":"1811.03782","version":3},"attestation_state":"computed","paper":{"title":"A Theoretically Guaranteed Deep Optimization Framework for Robust Compressive Sensing MRI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Risheng Liu, Shichao Cheng, Xin Fan, Yuxi Zhang, Zhongxuan Luo","submitted_at":"2018-11-09T05:35:50Z","abstract_excerpt":"Magnetic Resonance Imaging (MRI) is one of the most dynamic and safe imaging techniques available for clinical applications. However, the rather slow speed of MRI acquisitions limits the patient throughput and potential indi cations. Compressive Sensing (CS) has proven to be an efficient technique for accelerating MRI acquisition. The most widely used CS-MRI model, founded on the premise of reconstructing an image from an incompletely filled k-space, leads to an ill-posed inverse problem. In the past years, lots of efforts have been made to efficiently optimize the CS-MRI model. Inspired by de"},"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":"1811.03782","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-11-09T05:35:50Z","cross_cats_sorted":[],"title_canon_sha256":"4a5b264b7097a9692b4e6d05c0bc97c165094a13c64a37905b02176a8e728283","abstract_canon_sha256":"008b1ac8ad9f138ab06679268e3426bd522be327d99298539e010f68f2596c89"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:46.869253Z","signature_b64":"yBf7AceWGGVrEHwT/QYWOAe0b3gzAWVSzmZ0TVgWFMpMibeih/iOOV6mrPNRrD1WXsynp7cONpEvctKEmQRAAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2532d49ab5582b7d7dd40337e71848339f27f2f965370b09408771c0749000b8","last_reissued_at":"2026-05-18T00:00:46.868755Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:46.868755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Theoretically Guaranteed Deep Optimization Framework for Robust Compressive Sensing MRI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Risheng Liu, Shichao Cheng, Xin Fan, Yuxi Zhang, Zhongxuan Luo","submitted_at":"2018-11-09T05:35:50Z","abstract_excerpt":"Magnetic Resonance Imaging (MRI) is one of the most dynamic and safe imaging techniques available for clinical applications. However, the rather slow speed of MRI acquisitions limits the patient throughput and potential indi cations. Compressive Sensing (CS) has proven to be an efficient technique for accelerating MRI acquisition. The most widely used CS-MRI model, founded on the premise of reconstructing an image from an incompletely filled k-space, leads to an ill-posed inverse problem. In the past years, lots of efforts have been made to efficiently optimize the CS-MRI model. Inspired by de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.03782","kind":"arxiv","version":3},"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":"1811.03782","created_at":"2026-05-18T00:00:46.868826+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.03782v3","created_at":"2026-05-18T00:00:46.868826+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.03782","created_at":"2026-05-18T00:00:46.868826+00:00"},{"alias_kind":"pith_short_12","alias_value":"EUZNJGVVLAVX","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"EUZNJGVVLAVX27OU","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"EUZNJGVV","created_at":"2026-05-18T12:32:22.470017+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/EUZNJGVVLAVX27OUAM36OGCIGO","json":"https://pith.science/pith/EUZNJGVVLAVX27OUAM36OGCIGO.json","graph_json":"https://pith.science/api/pith-number/EUZNJGVVLAVX27OUAM36OGCIGO/graph.json","events_json":"https://pith.science/api/pith-number/EUZNJGVVLAVX27OUAM36OGCIGO/events.json","paper":"https://pith.science/paper/EUZNJGVV"},"agent_actions":{"view_html":"https://pith.science/pith/EUZNJGVVLAVX27OUAM36OGCIGO","download_json":"https://pith.science/pith/EUZNJGVVLAVX27OUAM36OGCIGO.json","view_paper":"https://pith.science/paper/EUZNJGVV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.03782&json=true","fetch_graph":"https://pith.science/api/pith-number/EUZNJGVVLAVX27OUAM36OGCIGO/graph.json","fetch_events":"https://pith.science/api/pith-number/EUZNJGVVLAVX27OUAM36OGCIGO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EUZNJGVVLAVX27OUAM36OGCIGO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EUZNJGVVLAVX27OUAM36OGCIGO/action/storage_attestation","attest_author":"https://pith.science/pith/EUZNJGVVLAVX27OUAM36OGCIGO/action/author_attestation","sign_citation":"https://pith.science/pith/EUZNJGVVLAVX27OUAM36OGCIGO/action/citation_signature","submit_replication":"https://pith.science/pith/EUZNJGVVLAVX27OUAM36OGCIGO/action/replication_record"}},"created_at":"2026-05-18T00:00:46.868826+00:00","updated_at":"2026-05-18T00:00:46.868826+00:00"}