{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:IUF2RQ7XMP4Q25M7QV63XRR37F","short_pith_number":"pith:IUF2RQ7X","canonical_record":{"source":{"id":"1711.02359","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-11-07T09:48:20Z","cross_cats_sorted":[],"title_canon_sha256":"e629f18edd645b9a61c811a75849302673efddde0ab2b05b014ba5e70431a12a","abstract_canon_sha256":"6bc3efa9f552648f56117351570982663baf92dae4945f10e5db6410d26d40c4"},"schema_version":"1.0"},"canonical_sha256":"450ba8c3f763f90d759f857dbbc63bf95fec4ad22bce427da8048059a2a99f2c","source":{"kind":"arxiv","id":"1711.02359","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.02359","created_at":"2026-05-18T00:31:08Z"},{"alias_kind":"arxiv_version","alias_value":"1711.02359v1","created_at":"2026-05-18T00:31:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02359","created_at":"2026-05-18T00:31:08Z"},{"alias_kind":"pith_short_12","alias_value":"IUF2RQ7XMP4Q","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IUF2RQ7XMP4Q25M7","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IUF2RQ7X","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:IUF2RQ7XMP4Q25M7QV63XRR37F","target":"record","payload":{"canonical_record":{"source":{"id":"1711.02359","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-11-07T09:48:20Z","cross_cats_sorted":[],"title_canon_sha256":"e629f18edd645b9a61c811a75849302673efddde0ab2b05b014ba5e70431a12a","abstract_canon_sha256":"6bc3efa9f552648f56117351570982663baf92dae4945f10e5db6410d26d40c4"},"schema_version":"1.0"},"canonical_sha256":"450ba8c3f763f90d759f857dbbc63bf95fec4ad22bce427da8048059a2a99f2c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:08.136982Z","signature_b64":"DuqRPS1sJT8o1Qpmp313jSLKMRfi+yR88g8a1QEMlY22nq6icxcs1BSrV5jH1hx3KnMzoTcHKdP9j+JlHrk6Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"450ba8c3f763f90d759f857dbbc63bf95fec4ad22bce427da8048059a2a99f2c","last_reissued_at":"2026-05-18T00:31:08.136258Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:08.136258Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.02359","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:31:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n018MgRdY7qhkY2+w934CGVhAOxiq+NaD1WYD0bsGtpj4SpDYRf3JuIJnUVDLNvWqaHtq9/hE8gWA6k9AebKBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:37:29.861282Z"},"content_sha256":"540f2a1e5cc0e347a614ff107810282e4df2e6f22f4ee3e3766ee34bc06985f3","schema_version":"1.0","event_id":"sha256:540f2a1e5cc0e347a614ff107810282e4df2e6f22f4ee3e3766ee34bc06985f3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:IUF2RQ7XMP4Q25M7QV63XRR37F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The finite steps of convergence of the fast thresholding algorithms with feedbacks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Hong Wang, Ningning Han, Shidong Li, Zhanjie Song","submitted_at":"2017-11-07T09:48:20Z","abstract_excerpt":"Iterative algorithms based on thresholding, feedback and null space tuning (NST+HT+FB) for sparse signal recovery are exceedingly effective and fast, particularly for large scale problems. The core algorithm is shown to converge in finitely many steps under a (preconditioned) restricted isometry condition. In this paper, we present a new perspective to analyze the algorithm, which turns out that the efficiency of the algorithm can be further elaborated by an estimate of the number of iterations for the guaranteed convergence. The convergence condition of NST+HT+FB is also improved. Moreover, a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02359","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:31:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0MZp19r8+VlLRTtZuilsrWqf9afPeD46y1czk7iV1GTMx37JbupqGj28Xb/S5Sucy0RskdQHzlwVLN+OJnXEBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:37:29.861635Z"},"content_sha256":"c0e21be837827e46fd9353428b160bb285cca159b48fef503a5379467d2dfb10","schema_version":"1.0","event_id":"sha256:c0e21be837827e46fd9353428b160bb285cca159b48fef503a5379467d2dfb10"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IUF2RQ7XMP4Q25M7QV63XRR37F/bundle.json","state_url":"https://pith.science/pith/IUF2RQ7XMP4Q25M7QV63XRR37F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IUF2RQ7XMP4Q25M7QV63XRR37F/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-01T17:37:29Z","links":{"resolver":"https://pith.science/pith/IUF2RQ7XMP4Q25M7QV63XRR37F","bundle":"https://pith.science/pith/IUF2RQ7XMP4Q25M7QV63XRR37F/bundle.json","state":"https://pith.science/pith/IUF2RQ7XMP4Q25M7QV63XRR37F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IUF2RQ7XMP4Q25M7QV63XRR37F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:IUF2RQ7XMP4Q25M7QV63XRR37F","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":"6bc3efa9f552648f56117351570982663baf92dae4945f10e5db6410d26d40c4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-11-07T09:48:20Z","title_canon_sha256":"e629f18edd645b9a61c811a75849302673efddde0ab2b05b014ba5e70431a12a"},"schema_version":"1.0","source":{"id":"1711.02359","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.02359","created_at":"2026-05-18T00:31:08Z"},{"alias_kind":"arxiv_version","alias_value":"1711.02359v1","created_at":"2026-05-18T00:31:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02359","created_at":"2026-05-18T00:31:08Z"},{"alias_kind":"pith_short_12","alias_value":"IUF2RQ7XMP4Q","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IUF2RQ7XMP4Q25M7","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IUF2RQ7X","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:c0e21be837827e46fd9353428b160bb285cca159b48fef503a5379467d2dfb10","target":"graph","created_at":"2026-05-18T00:31:08Z","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":"Iterative algorithms based on thresholding, feedback and null space tuning (NST+HT+FB) for sparse signal recovery are exceedingly effective and fast, particularly for large scale problems. The core algorithm is shown to converge in finitely many steps under a (preconditioned) restricted isometry condition. In this paper, we present a new perspective to analyze the algorithm, which turns out that the efficiency of the algorithm can be further elaborated by an estimate of the number of iterations for the guaranteed convergence. The convergence condition of NST+HT+FB is also improved. Moreover, a","authors_text":"Hong Wang, Ningning Han, Shidong Li, Zhanjie Song","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-11-07T09:48:20Z","title":"The finite steps of convergence of the fast thresholding algorithms with feedbacks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02359","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:540f2a1e5cc0e347a614ff107810282e4df2e6f22f4ee3e3766ee34bc06985f3","target":"record","created_at":"2026-05-18T00:31:08Z","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":"6bc3efa9f552648f56117351570982663baf92dae4945f10e5db6410d26d40c4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-11-07T09:48:20Z","title_canon_sha256":"e629f18edd645b9a61c811a75849302673efddde0ab2b05b014ba5e70431a12a"},"schema_version":"1.0","source":{"id":"1711.02359","kind":"arxiv","version":1}},"canonical_sha256":"450ba8c3f763f90d759f857dbbc63bf95fec4ad22bce427da8048059a2a99f2c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"450ba8c3f763f90d759f857dbbc63bf95fec4ad22bce427da8048059a2a99f2c","first_computed_at":"2026-05-18T00:31:08.136258Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:08.136258Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DuqRPS1sJT8o1Qpmp313jSLKMRfi+yR88g8a1QEMlY22nq6icxcs1BSrV5jH1hx3KnMzoTcHKdP9j+JlHrk6Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:08.136982Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.02359","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:540f2a1e5cc0e347a614ff107810282e4df2e6f22f4ee3e3766ee34bc06985f3","sha256:c0e21be837827e46fd9353428b160bb285cca159b48fef503a5379467d2dfb10"],"state_sha256":"41e658395b12938a6b8dc04f836a8029c36902ff5d13ad9639b7afc6071a2043"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jbHEbJGum85Gt3t9G6N1Z8X+Xwx/zvO1rI0O8hKKiECY9ik6wnrFyhJmIvgEoOu17YDk/SSjcolR0zHXEc1MBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T17:37:29.863642Z","bundle_sha256":"c7f3bffed41cc4cfc91d22da631570000c95efe5ae92cf311821bea2752c5eea"}}