{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:EDSYQXBZBIHMAWUDTAEXQZK25Z","short_pith_number":"pith:EDSYQXBZ","schema_version":"1.0","canonical_sha256":"20e5885c390a0ec05a83980978655aee7290da0633ff743e63d0776488ac4955","source":{"kind":"arxiv","id":"1705.06048","version":4},"attestation_state":"computed","paper":{"title":"Minimization of fraction function penalty in compressed sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Angang Cui, Haiyang Li, Jigen Peng, Qian Zhang","submitted_at":"2017-05-17T08:49:12Z","abstract_excerpt":"In the paper, we study the minimization problem of a non-convex sparsity promoting penalty function $$P_{a}(x)=\\sum_{i=1}^{n}p_{a}(x_{i})=\\sum_{i=1}^{n}\\frac{a|x_{i}|}{1+a|x_{i}|}$$ in compressed sensing, which is called fraction function. Firstly, we discuss the equivalence of $\\ell_{0}$ minimization and fraction function minimization. It is proved that there corresponds a constant $a^{**}>0$ such that, whenever $a>a^{**}$, every solution to $(FP_{a})$ also solves $(P_{0})$, that the uniqueness of global minimizer of $(FP_{a})$ and its equivalence to $(P_{0})$ if the sensing matrix $A$ satisf"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1705.06048","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-17T08:49:12Z","cross_cats_sorted":[],"title_canon_sha256":"a18057e999395a29bb6e0e419cece1b2f4f6de17cecc96f3858123e0669966ee","abstract_canon_sha256":"faff2bc2376af2c546ecbf5dda47bdddb533f55e779e1f5e8cdd8db52f57fceb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:26.916146Z","signature_b64":"c/oMDsVxwUoYtnPDiW0A62e24BPLIbIjijTj8hK2prsRNeIZB7UdA+Gil9LLX/WcIo048221VUkmIOzoWj1gBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20e5885c390a0ec05a83980978655aee7290da0633ff743e63d0776488ac4955","last_reissued_at":"2026-05-17T23:40:26.915470Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:26.915470Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimization of fraction function penalty in compressed sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Angang Cui, Haiyang Li, Jigen Peng, Qian Zhang","submitted_at":"2017-05-17T08:49:12Z","abstract_excerpt":"In the paper, we study the minimization problem of a non-convex sparsity promoting penalty function $$P_{a}(x)=\\sum_{i=1}^{n}p_{a}(x_{i})=\\sum_{i=1}^{n}\\frac{a|x_{i}|}{1+a|x_{i}|}$$ in compressed sensing, which is called fraction function. Firstly, we discuss the equivalence of $\\ell_{0}$ minimization and fraction function minimization. It is proved that there corresponds a constant $a^{**}>0$ such that, whenever $a>a^{**}$, every solution to $(FP_{a})$ also solves $(P_{0})$, that the uniqueness of global minimizer of $(FP_{a})$ and its equivalence to $(P_{0})$ if the sensing matrix $A$ satisf"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.06048","kind":"arxiv","version":4},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1705.06048","created_at":"2026-05-17T23:40:26.915563+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.06048v4","created_at":"2026-05-17T23:40:26.915563+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.06048","created_at":"2026-05-17T23:40:26.915563+00:00"},{"alias_kind":"pith_short_12","alias_value":"EDSYQXBZBIHM","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"EDSYQXBZBIHMAWUD","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"EDSYQXBZ","created_at":"2026-05-18T12:31:12.930513+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EDSYQXBZBIHMAWUDTAEXQZK25Z","json":"https://pith.science/pith/EDSYQXBZBIHMAWUDTAEXQZK25Z.json","graph_json":"https://pith.science/api/pith-number/EDSYQXBZBIHMAWUDTAEXQZK25Z/graph.json","events_json":"https://pith.science/api/pith-number/EDSYQXBZBIHMAWUDTAEXQZK25Z/events.json","paper":"https://pith.science/paper/EDSYQXBZ"},"agent_actions":{"view_html":"https://pith.science/pith/EDSYQXBZBIHMAWUDTAEXQZK25Z","download_json":"https://pith.science/pith/EDSYQXBZBIHMAWUDTAEXQZK25Z.json","view_paper":"https://pith.science/paper/EDSYQXBZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.06048&json=true","fetch_graph":"https://pith.science/api/pith-number/EDSYQXBZBIHMAWUDTAEXQZK25Z/graph.json","fetch_events":"https://pith.science/api/pith-number/EDSYQXBZBIHMAWUDTAEXQZK25Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EDSYQXBZBIHMAWUDTAEXQZK25Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EDSYQXBZBIHMAWUDTAEXQZK25Z/action/storage_attestation","attest_author":"https://pith.science/pith/EDSYQXBZBIHMAWUDTAEXQZK25Z/action/author_attestation","sign_citation":"https://pith.science/pith/EDSYQXBZBIHMAWUDTAEXQZK25Z/action/citation_signature","submit_replication":"https://pith.science/pith/EDSYQXBZBIHMAWUDTAEXQZK25Z/action/replication_record"}},"created_at":"2026-05-17T23:40:26.915563+00:00","updated_at":"2026-05-17T23:40:26.915563+00:00"}