{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:IHEXSVWH6ERWIORYX6SJDTEH5X","short_pith_number":"pith:IHEXSVWH","canonical_record":{"source":{"id":"1402.5744","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-02-24T08:18:53Z","cross_cats_sorted":[],"title_canon_sha256":"e0b1b8b5b298ea038a4d037c5267013cee53797a6d322c24ab2e78ded37a726f","abstract_canon_sha256":"f4d579288dab67b3f3ee17bfd9e100a2f5eeac51f686d5f4e84e6a0114190344"},"schema_version":"1.0"},"canonical_sha256":"41c97956c7f123643a38bfa491cc87ede79645c7d6cd9381d9a08d5d060864df","source":{"kind":"arxiv","id":"1402.5744","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.5744","created_at":"2026-05-18T01:36:20Z"},{"alias_kind":"arxiv_version","alias_value":"1402.5744v3","created_at":"2026-05-18T01:36:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.5744","created_at":"2026-05-18T01:36:20Z"},{"alias_kind":"pith_short_12","alias_value":"IHEXSVWH6ERW","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IHEXSVWH6ERWIORY","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IHEXSVWH","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:IHEXSVWH6ERWIORYX6SJDTEH5X","target":"record","payload":{"canonical_record":{"source":{"id":"1402.5744","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-02-24T08:18:53Z","cross_cats_sorted":[],"title_canon_sha256":"e0b1b8b5b298ea038a4d037c5267013cee53797a6d322c24ab2e78ded37a726f","abstract_canon_sha256":"f4d579288dab67b3f3ee17bfd9e100a2f5eeac51f686d5f4e84e6a0114190344"},"schema_version":"1.0"},"canonical_sha256":"41c97956c7f123643a38bfa491cc87ede79645c7d6cd9381d9a08d5d060864df","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:20.864192Z","signature_b64":"/OAAUxYROcgQu7CPFtaoyoFW8SQKZPa96o7xK8vJLvhUs/AZzr1wyDs8YMXODIIGrOL3f7egQfB1dsQd7TwwCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41c97956c7f123643a38bfa491cc87ede79645c7d6cd9381d9a08d5d060864df","last_reissued_at":"2026-05-18T01:36:20.863729Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:20.863729Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.5744","source_version":3,"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-18T01:36:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3t93KOHKBxz42jyIcOmRrkNwxo9foRjjm/P5oN95E0goyOh/SRshdz1Q2avCb17eq60acjXgsF++K5W1fuFBCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T18:02:22.783895Z"},"content_sha256":"88d50171fdbc2b625fc3b93930e80e402e3c4f6d93110c5fe5da70f1d1d9a90d","schema_version":"1.0","event_id":"sha256:88d50171fdbc2b625fc3b93930e80e402e3c4f6d93110c5fe5da70f1d1d9a90d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:IHEXSVWH6ERWIORYX6SJDTEH5X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sparse Regularization: Convergence Of Iterative Jumping Thresholding Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jinshan Zeng, Shaobo Lin, Zongben Xu","submitted_at":"2014-02-24T08:18:53Z","abstract_excerpt":"In recent studies on sparse modeling, non-convex penalties have received considerable attentions due to their superiorities on sparsity-inducing over the convex counterparts. Compared with the convex optimization approaches, however, the non-convex approaches have more challenging convergence analysis. In this paper, we study the convergence of a non-convex iterative thresholding algorithm for solving sparse recovery problems with a certain class of non-convex penalties, whose corresponding thresholding functions are discontinuous with jump discontinuities. Therefore, we call the algorithm the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.5744","kind":"arxiv","version":3},"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-18T01:36:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"juS4OPELaWGLsp8tGIuhZfJvtBpd38pEIXVh/y330pWlO/e8FGjjiphad5SvoeLDnlo0IhLNBsA2vC49LH+lBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T18:02:22.784233Z"},"content_sha256":"31d9555a7fcb017e3dafbaa6c669e45781daf6cc6927fb47e592f29377487748","schema_version":"1.0","event_id":"sha256:31d9555a7fcb017e3dafbaa6c669e45781daf6cc6927fb47e592f29377487748"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IHEXSVWH6ERWIORYX6SJDTEH5X/bundle.json","state_url":"https://pith.science/pith/IHEXSVWH6ERWIORYX6SJDTEH5X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IHEXSVWH6ERWIORYX6SJDTEH5X/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:02:22Z","links":{"resolver":"https://pith.science/pith/IHEXSVWH6ERWIORYX6SJDTEH5X","bundle":"https://pith.science/pith/IHEXSVWH6ERWIORYX6SJDTEH5X/bundle.json","state":"https://pith.science/pith/IHEXSVWH6ERWIORYX6SJDTEH5X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IHEXSVWH6ERWIORYX6SJDTEH5X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:IHEXSVWH6ERWIORYX6SJDTEH5X","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":"f4d579288dab67b3f3ee17bfd9e100a2f5eeac51f686d5f4e84e6a0114190344","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-02-24T08:18:53Z","title_canon_sha256":"e0b1b8b5b298ea038a4d037c5267013cee53797a6d322c24ab2e78ded37a726f"},"schema_version":"1.0","source":{"id":"1402.5744","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.5744","created_at":"2026-05-18T01:36:20Z"},{"alias_kind":"arxiv_version","alias_value":"1402.5744v3","created_at":"2026-05-18T01:36:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.5744","created_at":"2026-05-18T01:36:20Z"},{"alias_kind":"pith_short_12","alias_value":"IHEXSVWH6ERW","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IHEXSVWH6ERWIORY","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IHEXSVWH","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:31d9555a7fcb017e3dafbaa6c669e45781daf6cc6927fb47e592f29377487748","target":"graph","created_at":"2026-05-18T01:36:20Z","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 recent studies on sparse modeling, non-convex penalties have received considerable attentions due to their superiorities on sparsity-inducing over the convex counterparts. Compared with the convex optimization approaches, however, the non-convex approaches have more challenging convergence analysis. In this paper, we study the convergence of a non-convex iterative thresholding algorithm for solving sparse recovery problems with a certain class of non-convex penalties, whose corresponding thresholding functions are discontinuous with jump discontinuities. Therefore, we call the algorithm the","authors_text":"Jinshan Zeng, Shaobo Lin, Zongben Xu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-02-24T08:18:53Z","title":"Sparse Regularization: Convergence Of Iterative Jumping Thresholding Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.5744","kind":"arxiv","version":3},"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:88d50171fdbc2b625fc3b93930e80e402e3c4f6d93110c5fe5da70f1d1d9a90d","target":"record","created_at":"2026-05-18T01:36:20Z","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":"f4d579288dab67b3f3ee17bfd9e100a2f5eeac51f686d5f4e84e6a0114190344","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-02-24T08:18:53Z","title_canon_sha256":"e0b1b8b5b298ea038a4d037c5267013cee53797a6d322c24ab2e78ded37a726f"},"schema_version":"1.0","source":{"id":"1402.5744","kind":"arxiv","version":3}},"canonical_sha256":"41c97956c7f123643a38bfa491cc87ede79645c7d6cd9381d9a08d5d060864df","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"41c97956c7f123643a38bfa491cc87ede79645c7d6cd9381d9a08d5d060864df","first_computed_at":"2026-05-18T01:36:20.863729Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:20.863729Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/OAAUxYROcgQu7CPFtaoyoFW8SQKZPa96o7xK8vJLvhUs/AZzr1wyDs8YMXODIIGrOL3f7egQfB1dsQd7TwwCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:20.864192Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.5744","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:88d50171fdbc2b625fc3b93930e80e402e3c4f6d93110c5fe5da70f1d1d9a90d","sha256:31d9555a7fcb017e3dafbaa6c669e45781daf6cc6927fb47e592f29377487748"],"state_sha256":"9ff37838fc7c8182cbb91ced33dbb0578ddd423e7975567fb4e306202d3743f5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N4bK9QI06qHPZZ0jthZHm18+CD1VGVJm6lwn9jelWhUKGuu9Kt8kqYzn1J2H9He7h2hkz8NZPEy0pVV0YpQ0CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T18:02:22.786107Z","bundle_sha256":"8253c30023512a3a7d1167aaaa4d17fc580f1709dda2bc6eb80e6377c0ce397c"}}