{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:XNSNTEKZA22REYKMFGYEQTJOPY","short_pith_number":"pith:XNSNTEKZ","canonical_record":{"source":{"id":"1204.3700","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.IT","submitted_at":"2012-04-17T04:40:22Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"826950db88bce73e299df551b5c5f9f6f03825218c0dfac43491f20078d1caf9","abstract_canon_sha256":"583250a93c5c14cbc6c8805048160bf18c43dac4479ee100089f7a43c29d6699"},"schema_version":"1.0"},"canonical_sha256":"bb64d9915906b512614c29b0484d2e7e2b60a141687a74041e14640db85ca40c","source":{"kind":"arxiv","id":"1204.3700","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.3700","created_at":"2026-05-18T03:41:10Z"},{"alias_kind":"arxiv_version","alias_value":"1204.3700v2","created_at":"2026-05-18T03:41:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.3700","created_at":"2026-05-18T03:41:10Z"},{"alias_kind":"pith_short_12","alias_value":"XNSNTEKZA22R","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"XNSNTEKZA22REYKM","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"XNSNTEKZ","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:XNSNTEKZA22REYKMFGYEQTJOPY","target":"record","payload":{"canonical_record":{"source":{"id":"1204.3700","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.IT","submitted_at":"2012-04-17T04:40:22Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"826950db88bce73e299df551b5c5f9f6f03825218c0dfac43491f20078d1caf9","abstract_canon_sha256":"583250a93c5c14cbc6c8805048160bf18c43dac4479ee100089f7a43c29d6699"},"schema_version":"1.0"},"canonical_sha256":"bb64d9915906b512614c29b0484d2e7e2b60a141687a74041e14640db85ca40c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:10.694796Z","signature_b64":"Kkb4hYecE87oC9wo0sgu0CCT8MwnLnp6R9WTLKC5/Hls+CnZA9CR6Hb2Avmo0+bVBZolqrw4IpyqGK08UBMnCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb64d9915906b512614c29b0484d2e7e2b60a141687a74041e14640db85ca40c","last_reissued_at":"2026-05-18T03:41:10.694232Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:10.694232Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.3700","source_version":2,"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-18T03:41:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7O1VZXtwwDc94QDjNMcLMzOOScBuezNoecv8dz8hXaX+Z3v7fzzDuM2gJy8rdIlrLmvuy6tn5yelHqQeCnkDBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T18:55:03.334757Z"},"content_sha256":"0802cf7091f10440551938730bc5807a8916962872f1e088f0a3c90d3f6ea818","schema_version":"1.0","event_id":"sha256:0802cf7091f10440551938730bc5807a8916962872f1e088f0a3c90d3f6ea818"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:XNSNTEKZA22REYKMFGYEQTJOPY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast thresholding algorithms with feedbacks for sparse signal recovery","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Shidong Li, Tiebin Mi, Yulong Liu","submitted_at":"2012-04-17T04:40:22Z","abstract_excerpt":"We provide another framework of iterative algorithms based on thresholding, feedback and null space tuning for sparse signal recovery arising in sparse representations and compressed sensing. Several thresholding algorithms with various feedbacks are derived, which are seen as exceedingly effective and fast. Convergence results are also provided. The core algorithm is shown to converge in finite many steps under a (preconditioned) restricted isometry condition. The algorithms are seen as particularly effective for large scale problems. Numerical studies about the effectiveness and the speed of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.3700","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"},"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-18T03:41:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PmZKAC5mVOu5QTUe3+VoEfEhBDdP4l9zKVou/GuQM38tH+itLcuL4LqAOrvGm3yT3EyFKNFBON2DF/lc6mR8Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T18:55:03.335108Z"},"content_sha256":"9cf585cb1f5df2c6fbe812503ea7d06e22a487142d4f019b6aeca8723dd9e39e","schema_version":"1.0","event_id":"sha256:9cf585cb1f5df2c6fbe812503ea7d06e22a487142d4f019b6aeca8723dd9e39e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XNSNTEKZA22REYKMFGYEQTJOPY/bundle.json","state_url":"https://pith.science/pith/XNSNTEKZA22REYKMFGYEQTJOPY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XNSNTEKZA22REYKMFGYEQTJOPY/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-25T18:55:03Z","links":{"resolver":"https://pith.science/pith/XNSNTEKZA22REYKMFGYEQTJOPY","bundle":"https://pith.science/pith/XNSNTEKZA22REYKMFGYEQTJOPY/bundle.json","state":"https://pith.science/pith/XNSNTEKZA22REYKMFGYEQTJOPY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XNSNTEKZA22REYKMFGYEQTJOPY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:XNSNTEKZA22REYKMFGYEQTJOPY","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":"583250a93c5c14cbc6c8805048160bf18c43dac4479ee100089f7a43c29d6699","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.IT","submitted_at":"2012-04-17T04:40:22Z","title_canon_sha256":"826950db88bce73e299df551b5c5f9f6f03825218c0dfac43491f20078d1caf9"},"schema_version":"1.0","source":{"id":"1204.3700","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.3700","created_at":"2026-05-18T03:41:10Z"},{"alias_kind":"arxiv_version","alias_value":"1204.3700v2","created_at":"2026-05-18T03:41:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.3700","created_at":"2026-05-18T03:41:10Z"},{"alias_kind":"pith_short_12","alias_value":"XNSNTEKZA22R","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"XNSNTEKZA22REYKM","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"XNSNTEKZ","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:9cf585cb1f5df2c6fbe812503ea7d06e22a487142d4f019b6aeca8723dd9e39e","target":"graph","created_at":"2026-05-18T03:41:10Z","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":"We provide another framework of iterative algorithms based on thresholding, feedback and null space tuning for sparse signal recovery arising in sparse representations and compressed sensing. Several thresholding algorithms with various feedbacks are derived, which are seen as exceedingly effective and fast. Convergence results are also provided. The core algorithm is shown to converge in finite many steps under a (preconditioned) restricted isometry condition. The algorithms are seen as particularly effective for large scale problems. Numerical studies about the effectiveness and the speed of","authors_text":"Shidong Li, Tiebin Mi, Yulong Liu","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.IT","submitted_at":"2012-04-17T04:40:22Z","title":"Fast thresholding algorithms with feedbacks for sparse signal recovery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.3700","kind":"arxiv","version":2},"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:0802cf7091f10440551938730bc5807a8916962872f1e088f0a3c90d3f6ea818","target":"record","created_at":"2026-05-18T03:41:10Z","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":"583250a93c5c14cbc6c8805048160bf18c43dac4479ee100089f7a43c29d6699","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.IT","submitted_at":"2012-04-17T04:40:22Z","title_canon_sha256":"826950db88bce73e299df551b5c5f9f6f03825218c0dfac43491f20078d1caf9"},"schema_version":"1.0","source":{"id":"1204.3700","kind":"arxiv","version":2}},"canonical_sha256":"bb64d9915906b512614c29b0484d2e7e2b60a141687a74041e14640db85ca40c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bb64d9915906b512614c29b0484d2e7e2b60a141687a74041e14640db85ca40c","first_computed_at":"2026-05-18T03:41:10.694232Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:41:10.694232Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Kkb4hYecE87oC9wo0sgu0CCT8MwnLnp6R9WTLKC5/Hls+CnZA9CR6Hb2Avmo0+bVBZolqrw4IpyqGK08UBMnCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:41:10.694796Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.3700","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0802cf7091f10440551938730bc5807a8916962872f1e088f0a3c90d3f6ea818","sha256:9cf585cb1f5df2c6fbe812503ea7d06e22a487142d4f019b6aeca8723dd9e39e"],"state_sha256":"2174ba028b50cec588ea986ed982167b85321ccac311a02c88937f634d9de7ee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hPqk4B2v2C46NbzBYuRZ0otYKshmy7AJiekvQ4eB3dCmDXI3hR+NtsA+KkGeEh+b4Ls4JPRSfkNDmhuLU4wDBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T18:55:03.337000Z","bundle_sha256":"9e450de508501e960ad4fbb4ab6869a909fdf2fb4698c1ad719dd83dd127d1ec"}}