{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:SRJXOBTNZ3NSSJQF3E3CMCOJQJ","short_pith_number":"pith:SRJXOBTN","canonical_record":{"source":{"id":"1708.07010","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-23T14:09:38Z","cross_cats_sorted":[],"title_canon_sha256":"64bf857f425d4330c249dbdef9c5434ac2f7362d658bcfa9e0ea74a207e26f60","abstract_canon_sha256":"fcb7345bf6fafa852e2f47050341e564e8db701a2808b8d18f25c1c4449fed2d"},"schema_version":"1.0"},"canonical_sha256":"945377066dcedb292605d9362609c982793162a10fa54315c6f97eb362a6f1f3","source":{"kind":"arxiv","id":"1708.07010","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.07010","created_at":"2026-05-18T00:36:48Z"},{"alias_kind":"arxiv_version","alias_value":"1708.07010v1","created_at":"2026-05-18T00:36:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07010","created_at":"2026-05-18T00:36:48Z"},{"alias_kind":"pith_short_12","alias_value":"SRJXOBTNZ3NS","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SRJXOBTNZ3NSSJQF","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SRJXOBTN","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:SRJXOBTNZ3NSSJQF3E3CMCOJQJ","target":"record","payload":{"canonical_record":{"source":{"id":"1708.07010","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-23T14:09:38Z","cross_cats_sorted":[],"title_canon_sha256":"64bf857f425d4330c249dbdef9c5434ac2f7362d658bcfa9e0ea74a207e26f60","abstract_canon_sha256":"fcb7345bf6fafa852e2f47050341e564e8db701a2808b8d18f25c1c4449fed2d"},"schema_version":"1.0"},"canonical_sha256":"945377066dcedb292605d9362609c982793162a10fa54315c6f97eb362a6f1f3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:48.631824Z","signature_b64":"hSAI44fQue1YkTc/Pnbp9VpSKKsv+VTK/t4jCfz+CkRqQdU7FTF7tIaAzNEVfZs7alvTE3Vxhac2+Wtkgia3BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"945377066dcedb292605d9362609c982793162a10fa54315c6f97eb362a6f1f3","last_reissued_at":"2026-05-18T00:36:48.631322Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:48.631322Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.07010","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:36:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BOf+p5QZarIKI2mxMx/b+R1VuIb0f9+6orI0nhWOWtQOENs32rxjt7p45Ukz+ILjF2YLSYxbhLr5G34QsMhqBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T21:20:35.097496Z"},"content_sha256":"c3f0a5e6d4b9d67c6e4c42653d7170b0e37019bc0cb34f387a8bc4ff5b5a4798","schema_version":"1.0","event_id":"sha256:c3f0a5e6d4b9d67c6e4c42653d7170b0e37019bc0cb34f387a8bc4ff5b5a4798"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:SRJXOBTNZ3NSSJQF3E3CMCOJQJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Chong Li, Kaiwen Meng, Xiaoqi Yang, Yaohua Hu","submitted_at":"2017-08-23T14:09:38Z","abstract_excerpt":"The $\\ell_p$ regularization problem with $0< p< 1$ has been widely studied for finding sparse solutions of linear inverse problems and gained successful applications in various mathematics and applied science fields. The proximal gradient algorithm is one of the most popular algorithms for solving the $\\ell_p$ regularisation problem. In the present paper, we investigate the linear convergence issue of one inexact descent method and two inexact proximal gradient algorithms (PGA). For this purpose, an optimality condition theorem is explored to provide the equivalences among a local minimum, sec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07010","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:36:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8Ko2tay1wpUIgR1Y0YmOR43DqIwzPiESXN1LvnY11hfVbaJrAnnZ7yvG0CveQP5k+uMUADeko7l21+2zLp/YCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T21:20:35.098068Z"},"content_sha256":"9118cbbb79179cccb20dbfb051734e585cc13be3ef05da53a63b618a4a9e0af8","schema_version":"1.0","event_id":"sha256:9118cbbb79179cccb20dbfb051734e585cc13be3ef05da53a63b618a4a9e0af8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SRJXOBTNZ3NSSJQF3E3CMCOJQJ/bundle.json","state_url":"https://pith.science/pith/SRJXOBTNZ3NSSJQF3E3CMCOJQJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SRJXOBTNZ3NSSJQF3E3CMCOJQJ/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-06T21:20:35Z","links":{"resolver":"https://pith.science/pith/SRJXOBTNZ3NSSJQF3E3CMCOJQJ","bundle":"https://pith.science/pith/SRJXOBTNZ3NSSJQF3E3CMCOJQJ/bundle.json","state":"https://pith.science/pith/SRJXOBTNZ3NSSJQF3E3CMCOJQJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SRJXOBTNZ3NSSJQF3E3CMCOJQJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SRJXOBTNZ3NSSJQF3E3CMCOJQJ","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":"fcb7345bf6fafa852e2f47050341e564e8db701a2808b8d18f25c1c4449fed2d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-23T14:09:38Z","title_canon_sha256":"64bf857f425d4330c249dbdef9c5434ac2f7362d658bcfa9e0ea74a207e26f60"},"schema_version":"1.0","source":{"id":"1708.07010","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.07010","created_at":"2026-05-18T00:36:48Z"},{"alias_kind":"arxiv_version","alias_value":"1708.07010v1","created_at":"2026-05-18T00:36:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07010","created_at":"2026-05-18T00:36:48Z"},{"alias_kind":"pith_short_12","alias_value":"SRJXOBTNZ3NS","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SRJXOBTNZ3NSSJQF","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SRJXOBTN","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:9118cbbb79179cccb20dbfb051734e585cc13be3ef05da53a63b618a4a9e0af8","target":"graph","created_at":"2026-05-18T00:36:48Z","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":"The $\\ell_p$ regularization problem with $0< p< 1$ has been widely studied for finding sparse solutions of linear inverse problems and gained successful applications in various mathematics and applied science fields. The proximal gradient algorithm is one of the most popular algorithms for solving the $\\ell_p$ regularisation problem. In the present paper, we investigate the linear convergence issue of one inexact descent method and two inexact proximal gradient algorithms (PGA). For this purpose, an optimality condition theorem is explored to provide the equivalences among a local minimum, sec","authors_text":"Chong Li, Kaiwen Meng, Xiaoqi Yang, Yaohua Hu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-23T14:09:38Z","title":"Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07010","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:c3f0a5e6d4b9d67c6e4c42653d7170b0e37019bc0cb34f387a8bc4ff5b5a4798","target":"record","created_at":"2026-05-18T00:36:48Z","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":"fcb7345bf6fafa852e2f47050341e564e8db701a2808b8d18f25c1c4449fed2d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-23T14:09:38Z","title_canon_sha256":"64bf857f425d4330c249dbdef9c5434ac2f7362d658bcfa9e0ea74a207e26f60"},"schema_version":"1.0","source":{"id":"1708.07010","kind":"arxiv","version":1}},"canonical_sha256":"945377066dcedb292605d9362609c982793162a10fa54315c6f97eb362a6f1f3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"945377066dcedb292605d9362609c982793162a10fa54315c6f97eb362a6f1f3","first_computed_at":"2026-05-18T00:36:48.631322Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:48.631322Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hSAI44fQue1YkTc/Pnbp9VpSKKsv+VTK/t4jCfz+CkRqQdU7FTF7tIaAzNEVfZs7alvTE3Vxhac2+Wtkgia3BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:48.631824Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.07010","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c3f0a5e6d4b9d67c6e4c42653d7170b0e37019bc0cb34f387a8bc4ff5b5a4798","sha256:9118cbbb79179cccb20dbfb051734e585cc13be3ef05da53a63b618a4a9e0af8"],"state_sha256":"56291d8d86d1b97aa087725623ca041176388da5e59a5feab6231a2bfed792d1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"okCjEAY9r3oOErrih4rnb0uCazmlpOlcH1FxPe2lRQqE++bmFNfdBsj81tmWkj1gRWP/GScdZM0+z1LI04TPBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T21:20:35.101491Z","bundle_sha256":"d536b27a48ee69702839f4217216350ceead451cd1baa87140d5bd19a6a3d8e9"}}