{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:S3MRYT4SX5RFEI23BBPBRGWTYB","short_pith_number":"pith:S3MRYT4S","schema_version":"1.0","canonical_sha256":"96d91c4f92bf6252235b085e189ad3c044e62f0bf8c56a504662324132da19a5","source":{"kind":"arxiv","id":"1711.11075","version":1},"attestation_state":"computed","paper":{"title":"A fast nonconvex Compressed Sensing algorithm for highly low-sampled MR images reconstruction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.NA","authors_text":"Damiana Lazzaro, Elena Loli Piccolomini, Fabiana Zama","submitted_at":"2017-11-29T19:39:08Z","abstract_excerpt":"In this paper we present a fast and efficient method for the reconstruction of Magnetic Resonance Images (MRI) from severely under-sampled data. From the Compressed Sensing theory we have mathematically modeled the problem as a constrained minimization problem with a family of non-convex regularizing objective functions depending on a parameter and a least squares data fit constraint. We propose a fast and efficient algorithm, named Fast NonConvex Reweighting (FNCR) algorithm, based on an iterative scheme where the non-convex problem is approximated by its convex linearization and the penaliza"},"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":"1711.11075","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-11-29T19:39:08Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"e22e55bb5800544cabb5b9c2af1d470ba4081a4e01f66004089e3a43ffe08a23","abstract_canon_sha256":"528ddfbfdb8aa72c7232eaf0ba70080655c4713a97f82fed8f1c5080925b4c07"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:12.558511Z","signature_b64":"+dFxDgiRl7H8ZxexCJMHyR4KJkDO/T6RfqhBcaI3Lwz9REcXf8dqQg4Jjp49SZhthYX1S58UlijwMbVPuZR5Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96d91c4f92bf6252235b085e189ad3c044e62f0bf8c56a504662324132da19a5","last_reissued_at":"2026-05-18T00:29:12.557744Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:12.557744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A fast nonconvex Compressed Sensing algorithm for highly low-sampled MR images reconstruction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.NA","authors_text":"Damiana Lazzaro, Elena Loli Piccolomini, Fabiana Zama","submitted_at":"2017-11-29T19:39:08Z","abstract_excerpt":"In this paper we present a fast and efficient method for the reconstruction of Magnetic Resonance Images (MRI) from severely under-sampled data. From the Compressed Sensing theory we have mathematically modeled the problem as a constrained minimization problem with a family of non-convex regularizing objective functions depending on a parameter and a least squares data fit constraint. We propose a fast and efficient algorithm, named Fast NonConvex Reweighting (FNCR) algorithm, based on an iterative scheme where the non-convex problem is approximated by its convex linearization and the penaliza"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.11075","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":"1711.11075","created_at":"2026-05-18T00:29:12.557893+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.11075v1","created_at":"2026-05-18T00:29:12.557893+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.11075","created_at":"2026-05-18T00:29:12.557893+00:00"},{"alias_kind":"pith_short_12","alias_value":"S3MRYT4SX5RF","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"S3MRYT4SX5RFEI23","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"S3MRYT4S","created_at":"2026-05-18T12:31:43.269735+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/S3MRYT4SX5RFEI23BBPBRGWTYB","json":"https://pith.science/pith/S3MRYT4SX5RFEI23BBPBRGWTYB.json","graph_json":"https://pith.science/api/pith-number/S3MRYT4SX5RFEI23BBPBRGWTYB/graph.json","events_json":"https://pith.science/api/pith-number/S3MRYT4SX5RFEI23BBPBRGWTYB/events.json","paper":"https://pith.science/paper/S3MRYT4S"},"agent_actions":{"view_html":"https://pith.science/pith/S3MRYT4SX5RFEI23BBPBRGWTYB","download_json":"https://pith.science/pith/S3MRYT4SX5RFEI23BBPBRGWTYB.json","view_paper":"https://pith.science/paper/S3MRYT4S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.11075&json=true","fetch_graph":"https://pith.science/api/pith-number/S3MRYT4SX5RFEI23BBPBRGWTYB/graph.json","fetch_events":"https://pith.science/api/pith-number/S3MRYT4SX5RFEI23BBPBRGWTYB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S3MRYT4SX5RFEI23BBPBRGWTYB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S3MRYT4SX5RFEI23BBPBRGWTYB/action/storage_attestation","attest_author":"https://pith.science/pith/S3MRYT4SX5RFEI23BBPBRGWTYB/action/author_attestation","sign_citation":"https://pith.science/pith/S3MRYT4SX5RFEI23BBPBRGWTYB/action/citation_signature","submit_replication":"https://pith.science/pith/S3MRYT4SX5RFEI23BBPBRGWTYB/action/replication_record"}},"created_at":"2026-05-18T00:29:12.557893+00:00","updated_at":"2026-05-18T00:29:12.557893+00:00"}