{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:G2EVJMWPZBPRNLP5XM7FD6C6G4","short_pith_number":"pith:G2EVJMWP","canonical_record":{"source":{"id":"1105.0638","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-05-03T17:24:06Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"eb895bc457d131902ef6f68486467cd8fbc8407e84a91572f84d6d18772ca548","abstract_canon_sha256":"ac45d8959a093691ea45077d64626daaccecddce8ec75ba2d01626fa83296b22"},"schema_version":"1.0"},"canonical_sha256":"368954b2cfc85f16adfdbb3e51f85e373cb87c0e18a073920ed1551d58683a09","source":{"kind":"arxiv","id":"1105.0638","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.0638","created_at":"2026-05-18T04:23:10Z"},{"alias_kind":"arxiv_version","alias_value":"1105.0638v1","created_at":"2026-05-18T04:23:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.0638","created_at":"2026-05-18T04:23:10Z"},{"alias_kind":"pith_short_12","alias_value":"G2EVJMWPZBPR","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"G2EVJMWPZBPRNLP5","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"G2EVJMWP","created_at":"2026-05-18T12:26:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:G2EVJMWPZBPRNLP5XM7FD6C6G4","target":"record","payload":{"canonical_record":{"source":{"id":"1105.0638","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-05-03T17:24:06Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"eb895bc457d131902ef6f68486467cd8fbc8407e84a91572f84d6d18772ca548","abstract_canon_sha256":"ac45d8959a093691ea45077d64626daaccecddce8ec75ba2d01626fa83296b22"},"schema_version":"1.0"},"canonical_sha256":"368954b2cfc85f16adfdbb3e51f85e373cb87c0e18a073920ed1551d58683a09","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:23:10.974761Z","signature_b64":"J1dqegz0d6/gznNzcrwheZqyFfHhLCeggChcw0tB6wbVvHGpier5SG4s6jT3RyHp4I7G0h578gFM6gBPl+YeCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"368954b2cfc85f16adfdbb3e51f85e373cb87c0e18a073920ed1551d58683a09","last_reissued_at":"2026-05-18T04:23:10.974251Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:23:10.974251Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1105.0638","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-18T04:23:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l1YSkGw7IY+ScnHrTg5/VounxDAjg3j2Ddxfoj9Kqfsdc4w6rkV288vwszfZs/xORyuXvbLn+uj1h+VGVdWeCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T05:01:29.064944Z"},"content_sha256":"dde0b1542e8d4fc85e878c2d368ffe38b0826f637395123fbbb37966843a19fe","schema_version":"1.0","event_id":"sha256:dde0b1542e8d4fc85e878c2d368ffe38b0826f637395123fbbb37966843a19fe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:G2EVJMWPZBPRNLP5XM7FD6C6G4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complexity of Unconstrained L_2-L_p Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"cs.CC","authors_text":"Dongdong Ge, Xiaojun Chen, Yinyu Ye, Zizhuo Wang","submitted_at":"2011-05-03T17:24:06Z","abstract_excerpt":"We consider the unconstrained $L_2$-$L_p$ minimization: find a minimizer of $\\|Ax-b\\|^2_2+\\lambda \\|x\\|^p_p$ for given $A \\in R^{m\\times n}$, $b\\in R^m$ and parameters $\\lambda>0$, $p\\in [0,1)$. This problem has been studied extensively in variable selection and sparse least squares fitting for high dimensional data. Theoretical results show that the minimizers of the $L_2$-$L_p$ problem have various attractive features due to the concavity and non-Lipschitzian property of the regularization function $\\|\\cdot\\|^p_p$. In this paper, we show that the $L_q$-$L_p$ minimization problem is strongly "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.0638","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-18T04:23:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L1PNsUiOXU07tHb/ZV5TYxToKIzBDc2kQUZY9YKV5wvZJHgTCim0jsj+CW/2aay9o0EwtSDaD1SUPN34xs02Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T05:01:29.065292Z"},"content_sha256":"1b1d6dd02b4ac6e5d6957154b85dd08d7ef42ccbdfa16d4ed44960ca42c3285e","schema_version":"1.0","event_id":"sha256:1b1d6dd02b4ac6e5d6957154b85dd08d7ef42ccbdfa16d4ed44960ca42c3285e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G2EVJMWPZBPRNLP5XM7FD6C6G4/bundle.json","state_url":"https://pith.science/pith/G2EVJMWPZBPRNLP5XM7FD6C6G4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G2EVJMWPZBPRNLP5XM7FD6C6G4/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-28T05:01:29Z","links":{"resolver":"https://pith.science/pith/G2EVJMWPZBPRNLP5XM7FD6C6G4","bundle":"https://pith.science/pith/G2EVJMWPZBPRNLP5XM7FD6C6G4/bundle.json","state":"https://pith.science/pith/G2EVJMWPZBPRNLP5XM7FD6C6G4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G2EVJMWPZBPRNLP5XM7FD6C6G4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:G2EVJMWPZBPRNLP5XM7FD6C6G4","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":"ac45d8959a093691ea45077d64626daaccecddce8ec75ba2d01626fa83296b22","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-05-03T17:24:06Z","title_canon_sha256":"eb895bc457d131902ef6f68486467cd8fbc8407e84a91572f84d6d18772ca548"},"schema_version":"1.0","source":{"id":"1105.0638","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.0638","created_at":"2026-05-18T04:23:10Z"},{"alias_kind":"arxiv_version","alias_value":"1105.0638v1","created_at":"2026-05-18T04:23:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.0638","created_at":"2026-05-18T04:23:10Z"},{"alias_kind":"pith_short_12","alias_value":"G2EVJMWPZBPR","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"G2EVJMWPZBPRNLP5","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"G2EVJMWP","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:1b1d6dd02b4ac6e5d6957154b85dd08d7ef42ccbdfa16d4ed44960ca42c3285e","target":"graph","created_at":"2026-05-18T04:23:10Z","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":"We consider the unconstrained $L_2$-$L_p$ minimization: find a minimizer of $\\|Ax-b\\|^2_2+\\lambda \\|x\\|^p_p$ for given $A \\in R^{m\\times n}$, $b\\in R^m$ and parameters $\\lambda>0$, $p\\in [0,1)$. This problem has been studied extensively in variable selection and sparse least squares fitting for high dimensional data. Theoretical results show that the minimizers of the $L_2$-$L_p$ problem have various attractive features due to the concavity and non-Lipschitzian property of the regularization function $\\|\\cdot\\|^p_p$. In this paper, we show that the $L_q$-$L_p$ minimization problem is strongly ","authors_text":"Dongdong Ge, Xiaojun Chen, Yinyu Ye, Zizhuo Wang","cross_cats":["stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-05-03T17:24:06Z","title":"Complexity of Unconstrained L_2-L_p Minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.0638","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:dde0b1542e8d4fc85e878c2d368ffe38b0826f637395123fbbb37966843a19fe","target":"record","created_at":"2026-05-18T04:23:10Z","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":"ac45d8959a093691ea45077d64626daaccecddce8ec75ba2d01626fa83296b22","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-05-03T17:24:06Z","title_canon_sha256":"eb895bc457d131902ef6f68486467cd8fbc8407e84a91572f84d6d18772ca548"},"schema_version":"1.0","source":{"id":"1105.0638","kind":"arxiv","version":1}},"canonical_sha256":"368954b2cfc85f16adfdbb3e51f85e373cb87c0e18a073920ed1551d58683a09","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"368954b2cfc85f16adfdbb3e51f85e373cb87c0e18a073920ed1551d58683a09","first_computed_at":"2026-05-18T04:23:10.974251Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:23:10.974251Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"J1dqegz0d6/gznNzcrwheZqyFfHhLCeggChcw0tB6wbVvHGpier5SG4s6jT3RyHp4I7G0h578gFM6gBPl+YeCA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:23:10.974761Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.0638","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dde0b1542e8d4fc85e878c2d368ffe38b0826f637395123fbbb37966843a19fe","sha256:1b1d6dd02b4ac6e5d6957154b85dd08d7ef42ccbdfa16d4ed44960ca42c3285e"],"state_sha256":"c7738aba4d4824f0f44ef06a55f2268aaf529fee9f32637c11c51851b23e41f4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DBtIMLuHAWM9BaXcPzJOsEv+ZzzI1/5B4Trc0W0mHs87URqESzJjIo/NR40kymh4ldI3xP6ZdAd1TGwnJW5DBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T05:01:29.067542Z","bundle_sha256":"d5f80352d0cb353e3e8da5257f68f3a91ca1ee96c666ec9791cc5ce9e495eceb"}}