{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:5SBD6N7XMQNJN42MNHTCCERTOK","short_pith_number":"pith:5SBD6N7X","canonical_record":{"source":{"id":"1704.03121","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-04-11T02:35:27Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"67e6d636681d4cdbab8852a4a2552c304ea79de451458f622b105d36aa175dc7","abstract_canon_sha256":"811e62d32eead5c5a7334702bd0315f5ed9ca93e47a88f7a247819982fecc7da"},"schema_version":"1.0"},"canonical_sha256":"ec823f37f7641a96f34c69e62112337291344d2e8e2c68cba2e37abd09e10496","source":{"kind":"arxiv","id":"1704.03121","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.03121","created_at":"2026-05-18T00:43:50Z"},{"alias_kind":"arxiv_version","alias_value":"1704.03121v1","created_at":"2026-05-18T00:43:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.03121","created_at":"2026-05-18T00:43:50Z"},{"alias_kind":"pith_short_12","alias_value":"5SBD6N7XMQNJ","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5SBD6N7XMQNJN42M","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5SBD6N7X","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:5SBD6N7XMQNJN42MNHTCCERTOK","target":"record","payload":{"canonical_record":{"source":{"id":"1704.03121","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-04-11T02:35:27Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"67e6d636681d4cdbab8852a4a2552c304ea79de451458f622b105d36aa175dc7","abstract_canon_sha256":"811e62d32eead5c5a7334702bd0315f5ed9ca93e47a88f7a247819982fecc7da"},"schema_version":"1.0"},"canonical_sha256":"ec823f37f7641a96f34c69e62112337291344d2e8e2c68cba2e37abd09e10496","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:50.765772Z","signature_b64":"FggvOHnI+q8gGnHnnIniEX6GO+FSfA/Ha+dTQm5wcxGG5KJAkrZmAPI/wQlVqEyFz2e/c92r+2hpU25uEEq9DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec823f37f7641a96f34c69e62112337291344d2e8e2c68cba2e37abd09e10496","last_reissued_at":"2026-05-18T00:43:50.765236Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:50.765236Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.03121","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:43:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/lpVn36mTQjmvS7bGnA6xGTAiK7W0qYWInPZnD6VzUVBoXwyEbBCOQYHCjcG5l7L5ZBrMShGGCw5Ijls88TrAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:26:17.458815Z"},"content_sha256":"049885597d433babe4101a73a1ae927e2bbd403372331b72a0ffd58e927a1f86","schema_version":"1.0","event_id":"sha256:049885597d433babe4101a73a1ae927e2bbd403372331b72a0ffd58e927a1f86"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:5SBD6N7XMQNJN42MNHTCCERTOK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Iterative Soft/Hard Thresholding with Homotopy Continuation for Sparse Recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.NA","authors_text":"Bangti Jin, Xiliang Lu, Yuling Jiao","submitted_at":"2017-04-11T02:35:27Z","abstract_excerpt":"In this note, we analyze an iterative soft / hard thresholding algorithm with homotopy continuation for recovering a sparse signal $x^\\dag$ from noisy data of a noise level $\\epsilon$. Under suitable regularity and sparsity conditions, we design a path along which the algorithm can find a solution $x^*$ which admits a sharp reconstruction error $\\|x^* - x^\\dag\\|_{\\ell^\\infty} = O(\\epsilon)$ with an iteration complexity $O(\\frac{\\ln \\epsilon}{\\ln \\gamma} np)$, where $n$ and $p$ are problem dimensionality and $\\gamma\\in (0,1)$ controls the length of the path. Numerical examples are given to illu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.03121","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:43:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cjFp5HmAw44sOFSCqHBCuaJGCa6GL35eVnbR6JwAUSlN7ECGND5Pv6/6Fi6NXbWEANK/TsE1y5gnquvZQuZtAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:26:17.459434Z"},"content_sha256":"59f9ac1863c4d17dc64d51abc4808fea713995d39ecea15abb3d63b656fe2725","schema_version":"1.0","event_id":"sha256:59f9ac1863c4d17dc64d51abc4808fea713995d39ecea15abb3d63b656fe2725"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5SBD6N7XMQNJN42MNHTCCERTOK/bundle.json","state_url":"https://pith.science/pith/5SBD6N7XMQNJN42MNHTCCERTOK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5SBD6N7XMQNJN42MNHTCCERTOK/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-05-30T15:26:17Z","links":{"resolver":"https://pith.science/pith/5SBD6N7XMQNJN42MNHTCCERTOK","bundle":"https://pith.science/pith/5SBD6N7XMQNJN42MNHTCCERTOK/bundle.json","state":"https://pith.science/pith/5SBD6N7XMQNJN42MNHTCCERTOK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5SBD6N7XMQNJN42MNHTCCERTOK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:5SBD6N7XMQNJN42MNHTCCERTOK","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":"811e62d32eead5c5a7334702bd0315f5ed9ca93e47a88f7a247819982fecc7da","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-04-11T02:35:27Z","title_canon_sha256":"67e6d636681d4cdbab8852a4a2552c304ea79de451458f622b105d36aa175dc7"},"schema_version":"1.0","source":{"id":"1704.03121","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.03121","created_at":"2026-05-18T00:43:50Z"},{"alias_kind":"arxiv_version","alias_value":"1704.03121v1","created_at":"2026-05-18T00:43:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.03121","created_at":"2026-05-18T00:43:50Z"},{"alias_kind":"pith_short_12","alias_value":"5SBD6N7XMQNJ","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5SBD6N7XMQNJN42M","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5SBD6N7X","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:59f9ac1863c4d17dc64d51abc4808fea713995d39ecea15abb3d63b656fe2725","target":"graph","created_at":"2026-05-18T00:43:50Z","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 note, we analyze an iterative soft / hard thresholding algorithm with homotopy continuation for recovering a sparse signal $x^\\dag$ from noisy data of a noise level $\\epsilon$. Under suitable regularity and sparsity conditions, we design a path along which the algorithm can find a solution $x^*$ which admits a sharp reconstruction error $\\|x^* - x^\\dag\\|_{\\ell^\\infty} = O(\\epsilon)$ with an iteration complexity $O(\\frac{\\ln \\epsilon}{\\ln \\gamma} np)$, where $n$ and $p$ are problem dimensionality and $\\gamma\\in (0,1)$ controls the length of the path. Numerical examples are given to illu","authors_text":"Bangti Jin, Xiliang Lu, Yuling Jiao","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-04-11T02:35:27Z","title":"Iterative Soft/Hard Thresholding with Homotopy Continuation for Sparse Recovery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.03121","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:049885597d433babe4101a73a1ae927e2bbd403372331b72a0ffd58e927a1f86","target":"record","created_at":"2026-05-18T00:43:50Z","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":"811e62d32eead5c5a7334702bd0315f5ed9ca93e47a88f7a247819982fecc7da","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-04-11T02:35:27Z","title_canon_sha256":"67e6d636681d4cdbab8852a4a2552c304ea79de451458f622b105d36aa175dc7"},"schema_version":"1.0","source":{"id":"1704.03121","kind":"arxiv","version":1}},"canonical_sha256":"ec823f37f7641a96f34c69e62112337291344d2e8e2c68cba2e37abd09e10496","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ec823f37f7641a96f34c69e62112337291344d2e8e2c68cba2e37abd09e10496","first_computed_at":"2026-05-18T00:43:50.765236Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:50.765236Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FggvOHnI+q8gGnHnnIniEX6GO+FSfA/Ha+dTQm5wcxGG5KJAkrZmAPI/wQlVqEyFz2e/c92r+2hpU25uEEq9DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:50.765772Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.03121","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:049885597d433babe4101a73a1ae927e2bbd403372331b72a0ffd58e927a1f86","sha256:59f9ac1863c4d17dc64d51abc4808fea713995d39ecea15abb3d63b656fe2725"],"state_sha256":"f346714cdbfeb3528d8106d2afb702c07fd24d04b8351254715f7d32275654cb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DCD0B8POLVdr3HGst9ShvrmPfe/Eoo20a9+R4JeARqIfkhtk966bf0VLVOOyEqPdJCGqMAZWvk0k/qZ1QkFBDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T15:26:17.462816Z","bundle_sha256":"1bb05cbb074fa66a3315ce3c9fb0bfdfb8ba6d6979d03c2e96ee6333bbafb3a7"}}