{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:P7KI7F463VF4JL2VZGPK3UU62F","short_pith_number":"pith:P7KI7F46","schema_version":"1.0","canonical_sha256":"7fd48f979edd4bc4af55c99eadd29ed167a789ac6a4f98a8afed552e6afb0ff2","source":{"kind":"arxiv","id":"1504.07786","version":2},"attestation_state":"computed","paper":{"title":"Projected Iterative Soft-thresholding Algorithm for Tight Frames in Compressed Sensing Magnetic Resonance Imaging","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","math.OC"],"primary_cat":"physics.med-ph","authors_text":"Di Guo, Jian-Feng Cai, Xiaobo Qu, Yunsong Liu, Zhifang Zhan, Zhong Chen","submitted_at":"2015-04-29T09:35:31Z","abstract_excerpt":"Compressed sensing has shown great potentials in accelerating magnetic resonance imaging. Fast image reconstruction and high image quality are two main issues faced by this new technology. It has been shown that, redundant image representations, e.g. tight frames, can significantly improve the image quality. But how to efficiently solve the reconstruction problem with these redundant representation systems is still challenging. This paper attempts to address the problem of applying iterative soft-thresholding algorithm (ISTA) to tight frames based magnetic resonance image reconstruction. By in"},"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":"1504.07786","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.med-ph","submitted_at":"2015-04-29T09:35:31Z","cross_cats_sorted":["cs.CV","math.OC"],"title_canon_sha256":"810384edbc6f9d065860fa0d36e2b7acab6fa69b1a3de86424337be9fda4f941","abstract_canon_sha256":"fa821245b748038bf8971967f0e093162230db9c9611a46a319caeb11a87c524"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:01.628729Z","signature_b64":"LXqd+H8KthpAYzeoRLvRsWWDtYMhRTK/BML4w37rPIvX80TtqboVGR702/dC1QLvnHeZnkIbmbvJoNYPKMPwDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7fd48f979edd4bc4af55c99eadd29ed167a789ac6a4f98a8afed552e6afb0ff2","last_reissued_at":"2026-05-18T01:22:01.628206Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:01.628206Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Projected Iterative Soft-thresholding Algorithm for Tight Frames in Compressed Sensing Magnetic Resonance Imaging","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","math.OC"],"primary_cat":"physics.med-ph","authors_text":"Di Guo, Jian-Feng Cai, Xiaobo Qu, Yunsong Liu, Zhifang Zhan, Zhong Chen","submitted_at":"2015-04-29T09:35:31Z","abstract_excerpt":"Compressed sensing has shown great potentials in accelerating magnetic resonance imaging. Fast image reconstruction and high image quality are two main issues faced by this new technology. It has been shown that, redundant image representations, e.g. tight frames, can significantly improve the image quality. But how to efficiently solve the reconstruction problem with these redundant representation systems is still challenging. This paper attempts to address the problem of applying iterative soft-thresholding algorithm (ISTA) to tight frames based magnetic resonance image reconstruction. By in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.07786","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":""},"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":"1504.07786","created_at":"2026-05-18T01:22:01.628282+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.07786v2","created_at":"2026-05-18T01:22:01.628282+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.07786","created_at":"2026-05-18T01:22:01.628282+00:00"},{"alias_kind":"pith_short_12","alias_value":"P7KI7F463VF4","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"P7KI7F463VF4JL2V","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"P7KI7F46","created_at":"2026-05-18T12:29:34.919912+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/P7KI7F463VF4JL2VZGPK3UU62F","json":"https://pith.science/pith/P7KI7F463VF4JL2VZGPK3UU62F.json","graph_json":"https://pith.science/api/pith-number/P7KI7F463VF4JL2VZGPK3UU62F/graph.json","events_json":"https://pith.science/api/pith-number/P7KI7F463VF4JL2VZGPK3UU62F/events.json","paper":"https://pith.science/paper/P7KI7F46"},"agent_actions":{"view_html":"https://pith.science/pith/P7KI7F463VF4JL2VZGPK3UU62F","download_json":"https://pith.science/pith/P7KI7F463VF4JL2VZGPK3UU62F.json","view_paper":"https://pith.science/paper/P7KI7F46","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.07786&json=true","fetch_graph":"https://pith.science/api/pith-number/P7KI7F463VF4JL2VZGPK3UU62F/graph.json","fetch_events":"https://pith.science/api/pith-number/P7KI7F463VF4JL2VZGPK3UU62F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P7KI7F463VF4JL2VZGPK3UU62F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P7KI7F463VF4JL2VZGPK3UU62F/action/storage_attestation","attest_author":"https://pith.science/pith/P7KI7F463VF4JL2VZGPK3UU62F/action/author_attestation","sign_citation":"https://pith.science/pith/P7KI7F463VF4JL2VZGPK3UU62F/action/citation_signature","submit_replication":"https://pith.science/pith/P7KI7F463VF4JL2VZGPK3UU62F/action/replication_record"}},"created_at":"2026-05-18T01:22:01.628282+00:00","updated_at":"2026-05-18T01:22:01.628282+00:00"}