{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:S3MRYT4SX5RFEI23BBPBRGWTYB","short_pith_number":"pith:S3MRYT4S","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"},"canonical_sha256":"96d91c4f92bf6252235b085e189ad3c044e62f0bf8c56a504662324132da19a5","source":{"kind":"arxiv","id":"1711.11075","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.11075","created_at":"2026-05-18T00:29:12Z"},{"alias_kind":"arxiv_version","alias_value":"1711.11075v1","created_at":"2026-05-18T00:29:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.11075","created_at":"2026-05-18T00:29:12Z"},{"alias_kind":"pith_short_12","alias_value":"S3MRYT4SX5RF","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"S3MRYT4SX5RFEI23","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"S3MRYT4S","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:S3MRYT4SX5RFEI23BBPBRGWTYB","target":"record","payload":{"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"},"canonical_sha256":"96d91c4f92bf6252235b085e189ad3c044e62f0bf8c56a504662324132da19a5","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"},"source_kind":"arxiv","source_id":"1711.11075","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:29:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MYC3yff30uOns0DQNQWJc95RKZOWdhD86I+gZI7xjPUM5BhwP6xBge3Sbb8VuenHv6Ej8iV/JkprFp5ty/drAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T09:59:17.592945Z"},"content_sha256":"f45eb01982017739d7f7c635b201755c3745cb9bad8fca7d2465dca9b71f12a5","schema_version":"1.0","event_id":"sha256:f45eb01982017739d7f7c635b201755c3745cb9bad8fca7d2465dca9b71f12a5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:S3MRYT4SX5RFEI23BBPBRGWTYB","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:29:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T5PJCPnIg838Z4Hh5be7OKDOKb1xYMT6a07kvD8CW5CC3HJYTwBK+QRG4sWrNpHSUfd/MyP2nBMw+XJYdCq+Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T09:59:17.593282Z"},"content_sha256":"9a67382d8928576e8d34cf5b2b3095913d99f73a54cffa107c59feaea085b764","schema_version":"1.0","event_id":"sha256:9a67382d8928576e8d34cf5b2b3095913d99f73a54cffa107c59feaea085b764"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S3MRYT4SX5RFEI23BBPBRGWTYB/bundle.json","state_url":"https://pith.science/pith/S3MRYT4SX5RFEI23BBPBRGWTYB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S3MRYT4SX5RFEI23BBPBRGWTYB/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-28T09:59:17Z","links":{"resolver":"https://pith.science/pith/S3MRYT4SX5RFEI23BBPBRGWTYB","bundle":"https://pith.science/pith/S3MRYT4SX5RFEI23BBPBRGWTYB/bundle.json","state":"https://pith.science/pith/S3MRYT4SX5RFEI23BBPBRGWTYB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S3MRYT4SX5RFEI23BBPBRGWTYB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:S3MRYT4SX5RFEI23BBPBRGWTYB","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"528ddfbfdb8aa72c7232eaf0ba70080655c4713a97f82fed8f1c5080925b4c07","cross_cats_sorted":["cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-11-29T19:39:08Z","title_canon_sha256":"e22e55bb5800544cabb5b9c2af1d470ba4081a4e01f66004089e3a43ffe08a23"},"schema_version":"1.0","source":{"id":"1711.11075","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.11075","created_at":"2026-05-18T00:29:12Z"},{"alias_kind":"arxiv_version","alias_value":"1711.11075v1","created_at":"2026-05-18T00:29:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.11075","created_at":"2026-05-18T00:29:12Z"},{"alias_kind":"pith_short_12","alias_value":"S3MRYT4SX5RF","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"S3MRYT4SX5RFEI23","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"S3MRYT4S","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:9a67382d8928576e8d34cf5b2b3095913d99f73a54cffa107c59feaea085b764","target":"graph","created_at":"2026-05-18T00:29:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Damiana Lazzaro, Elena Loli Piccolomini, Fabiana Zama","cross_cats":["cs.CV"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-11-29T19:39:08Z","title":"A fast nonconvex Compressed Sensing algorithm for highly low-sampled MR images reconstruction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.11075","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f45eb01982017739d7f7c635b201755c3745cb9bad8fca7d2465dca9b71f12a5","target":"record","created_at":"2026-05-18T00:29:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"528ddfbfdb8aa72c7232eaf0ba70080655c4713a97f82fed8f1c5080925b4c07","cross_cats_sorted":["cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-11-29T19:39:08Z","title_canon_sha256":"e22e55bb5800544cabb5b9c2af1d470ba4081a4e01f66004089e3a43ffe08a23"},"schema_version":"1.0","source":{"id":"1711.11075","kind":"arxiv","version":1}},"canonical_sha256":"96d91c4f92bf6252235b085e189ad3c044e62f0bf8c56a504662324132da19a5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"96d91c4f92bf6252235b085e189ad3c044e62f0bf8c56a504662324132da19a5","first_computed_at":"2026-05-18T00:29:12.557744Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:12.557744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+dFxDgiRl7H8ZxexCJMHyR4KJkDO/T6RfqhBcaI3Lwz9REcXf8dqQg4Jjp49SZhthYX1S58UlijwMbVPuZR5Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:12.558511Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.11075","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f45eb01982017739d7f7c635b201755c3745cb9bad8fca7d2465dca9b71f12a5","sha256:9a67382d8928576e8d34cf5b2b3095913d99f73a54cffa107c59feaea085b764"],"state_sha256":"be1a2722730c5f8993f940a0d98640e21ccc7ffcec5f815951c7de3db207f32d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0LjftKjdVCQ6WRBH2L25gILDFr2+u88eYnVjR5jUGfsrlcY59Qd277Ttga/ziJsq7Pg0dynu6BogVzYVtYLJBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T09:59:17.595212Z","bundle_sha256":"851156140767c0a73a48ee0574ad05e39d1868dcdf1badc97ccafa5c8995f634"}}