{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:AIZY3CG6XHBEZT2CDHWS4OKB4B","short_pith_number":"pith:AIZY3CG6","canonical_record":{"source":{"id":"1804.09385","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-04-25T06:58:09Z","cross_cats_sorted":[],"title_canon_sha256":"df964bbbf2f2554e397da7e01eaba03e3b03e057dec2fb76b5d7ce8a0ef1d871","abstract_canon_sha256":"c2cea77734c8d3376aa3dceb152fc3ff68832c2fb89a85817cff9d666a1e58ca"},"schema_version":"1.0"},"canonical_sha256":"02338d88deb9c24ccf4219ed2e3941e04993f3e90f6b54dea53a86fadf91140c","source":{"kind":"arxiv","id":"1804.09385","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.09385","created_at":"2026-05-18T00:17:31Z"},{"alias_kind":"arxiv_version","alias_value":"1804.09385v1","created_at":"2026-05-18T00:17:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.09385","created_at":"2026-05-18T00:17:31Z"},{"alias_kind":"pith_short_12","alias_value":"AIZY3CG6XHBE","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AIZY3CG6XHBEZT2C","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AIZY3CG6","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:AIZY3CG6XHBEZT2CDHWS4OKB4B","target":"record","payload":{"canonical_record":{"source":{"id":"1804.09385","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-04-25T06:58:09Z","cross_cats_sorted":[],"title_canon_sha256":"df964bbbf2f2554e397da7e01eaba03e3b03e057dec2fb76b5d7ce8a0ef1d871","abstract_canon_sha256":"c2cea77734c8d3376aa3dceb152fc3ff68832c2fb89a85817cff9d666a1e58ca"},"schema_version":"1.0"},"canonical_sha256":"02338d88deb9c24ccf4219ed2e3941e04993f3e90f6b54dea53a86fadf91140c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:31.988010Z","signature_b64":"7ICh3OLHQAgVi/scAp8clbtS/EGsSNqml8Bx3Yv6mV9pPFC3yLpVrtU4Fp+nsuhRc/MpXGw/J9Io2Iw55lCTDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02338d88deb9c24ccf4219ed2e3941e04993f3e90f6b54dea53a86fadf91140c","last_reissued_at":"2026-05-18T00:17:31.987463Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:31.987463Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.09385","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:17:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MGbjEdxc4Tq69Z58hhUYscZxK9GLutHC76bxCRDRUNHdrwYz3+DOp0dp8R+2wVEudo5DFdONTAj2/kFZEvWsCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:20:31.358371Z"},"content_sha256":"f01c820ca630bca6a75619185254408078721369f40d24dd4b14274204799489","schema_version":"1.0","event_id":"sha256:f01c820ca630bca6a75619185254408078721369f40d24dd4b14274204799489"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:AIZY3CG6XHBEZT2CDHWS4OKB4B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Iterative thresholding algorithm based on non-convex method for modified lp-norm regularization minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Angang Cui, Haiyang Li, Jiajun Xiong, Jigen Peng, Meng Wen","submitted_at":"2018-04-25T06:58:09Z","abstract_excerpt":"Recently, the $\\l_{p}$-norm regularization minimization problem $(P_{p}^{\\lambda})$ has attracted great attention in compressed sensing. However, the $\\l_{p}$-norm $\\|x\\|_{p}^{p}$ in problem $(P_{p}^{\\lambda})$ is nonconvex and non-Lipschitz for all $p\\in(0,1)$, and there are not many optimization theories and methods are proposed to solve this problem. In fact, it is NP-hard for all $p\\in(0,1)$ and $\\lambda>0$. In this paper, we study two modified $\\l_{p}$ regularization minimization problems to approximate the NP-hard problem $(P_{p}^{\\lambda})$. Inspired by the good performance of Half algo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.09385","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:17:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a2KJ+1XzrgmHVwi+fL5RQczaxddTrpEAAp5MpuuJlv8EFNbmQFf3pYcMIkLBET9+GGmQxiqKY+besAL+L9M7BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:20:31.358723Z"},"content_sha256":"bb7f48f16f11486ee3714815d485e2bdf19fb01f816d5f4a956939a26f62589a","schema_version":"1.0","event_id":"sha256:bb7f48f16f11486ee3714815d485e2bdf19fb01f816d5f4a956939a26f62589a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AIZY3CG6XHBEZT2CDHWS4OKB4B/bundle.json","state_url":"https://pith.science/pith/AIZY3CG6XHBEZT2CDHWS4OKB4B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AIZY3CG6XHBEZT2CDHWS4OKB4B/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-03T17:20:31Z","links":{"resolver":"https://pith.science/pith/AIZY3CG6XHBEZT2CDHWS4OKB4B","bundle":"https://pith.science/pith/AIZY3CG6XHBEZT2CDHWS4OKB4B/bundle.json","state":"https://pith.science/pith/AIZY3CG6XHBEZT2CDHWS4OKB4B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AIZY3CG6XHBEZT2CDHWS4OKB4B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:AIZY3CG6XHBEZT2CDHWS4OKB4B","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":"c2cea77734c8d3376aa3dceb152fc3ff68832c2fb89a85817cff9d666a1e58ca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-04-25T06:58:09Z","title_canon_sha256":"df964bbbf2f2554e397da7e01eaba03e3b03e057dec2fb76b5d7ce8a0ef1d871"},"schema_version":"1.0","source":{"id":"1804.09385","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.09385","created_at":"2026-05-18T00:17:31Z"},{"alias_kind":"arxiv_version","alias_value":"1804.09385v1","created_at":"2026-05-18T00:17:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.09385","created_at":"2026-05-18T00:17:31Z"},{"alias_kind":"pith_short_12","alias_value":"AIZY3CG6XHBE","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AIZY3CG6XHBEZT2C","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AIZY3CG6","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:bb7f48f16f11486ee3714815d485e2bdf19fb01f816d5f4a956939a26f62589a","target":"graph","created_at":"2026-05-18T00:17:31Z","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":"Recently, the $\\l_{p}$-norm regularization minimization problem $(P_{p}^{\\lambda})$ has attracted great attention in compressed sensing. However, the $\\l_{p}$-norm $\\|x\\|_{p}^{p}$ in problem $(P_{p}^{\\lambda})$ is nonconvex and non-Lipschitz for all $p\\in(0,1)$, and there are not many optimization theories and methods are proposed to solve this problem. In fact, it is NP-hard for all $p\\in(0,1)$ and $\\lambda>0$. In this paper, we study two modified $\\l_{p}$ regularization minimization problems to approximate the NP-hard problem $(P_{p}^{\\lambda})$. Inspired by the good performance of Half algo","authors_text":"Angang Cui, Haiyang Li, Jiajun Xiong, Jigen Peng, Meng Wen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-04-25T06:58:09Z","title":"Iterative thresholding algorithm based on non-convex method for modified lp-norm regularization minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.09385","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:f01c820ca630bca6a75619185254408078721369f40d24dd4b14274204799489","target":"record","created_at":"2026-05-18T00:17:31Z","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":"c2cea77734c8d3376aa3dceb152fc3ff68832c2fb89a85817cff9d666a1e58ca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-04-25T06:58:09Z","title_canon_sha256":"df964bbbf2f2554e397da7e01eaba03e3b03e057dec2fb76b5d7ce8a0ef1d871"},"schema_version":"1.0","source":{"id":"1804.09385","kind":"arxiv","version":1}},"canonical_sha256":"02338d88deb9c24ccf4219ed2e3941e04993f3e90f6b54dea53a86fadf91140c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"02338d88deb9c24ccf4219ed2e3941e04993f3e90f6b54dea53a86fadf91140c","first_computed_at":"2026-05-18T00:17:31.987463Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:31.987463Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7ICh3OLHQAgVi/scAp8clbtS/EGsSNqml8Bx3Yv6mV9pPFC3yLpVrtU4Fp+nsuhRc/MpXGw/J9Io2Iw55lCTDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:31.988010Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.09385","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f01c820ca630bca6a75619185254408078721369f40d24dd4b14274204799489","sha256:bb7f48f16f11486ee3714815d485e2bdf19fb01f816d5f4a956939a26f62589a"],"state_sha256":"e399f09c8619721b54ec8fcfcacc3fc518856b9cedcf33688dfe7008cbeef27b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4KbrrMvFEqrHO/MEwzPVfmHg0W9RP3abZ+TvlT1bGt2lISrNcK8MYJq18HNdGNfRoNkq85qd5VWVJWXP7HHHAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T17:20:31.360671Z","bundle_sha256":"824702af71e1780ba745f27244033d71376c35cd673b9ce6ea80a93af21b0fd4"}}