{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:XQQ7KNCLUDJK3LMZPIJCWE75OZ","short_pith_number":"pith:XQQ7KNCL","schema_version":"1.0","canonical_sha256":"bc21f5344ba0d2adad997a122b13fd7664e96b191a1e6a241fae1f0ee8909845","source":{"kind":"arxiv","id":"1805.11942","version":2},"attestation_state":"computed","paper":{"title":"A Lagrangian Dual Based Approach to Sparse Linear Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Chen Zhao, Houduo Qi, Naihua Xiu, Weiyue Li, Ziyan Luo","submitted_at":"2018-05-30T13:34:44Z","abstract_excerpt":"A sparse linear programming (SLP) problem is a linear programming problem equipped with a sparsity (or cardinality) constraint, which is nonconvex and discontinuous theoretically and generally NP-hard computationally due to the combinatorial property involved. By rewriting the sparsity constraint into a disjunctive form, we present an explicit formula of its Lagrangian dual in terms of an unconstrained piecewise-linear convex programming problem which admits a strong duality. A semi-proximal alternating direction method of multipliers (sPADMM) is then proposed to solve this dual problem by tak"},"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":"1805.11942","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-30T13:34:44Z","cross_cats_sorted":[],"title_canon_sha256":"fc3811ede2b68440117aeb1a27078986fa34a4963a5749ee172ca144afe6ca1d","abstract_canon_sha256":"e069a2a0ecee17231b317f3ea55cfc17b8e0135362e055f46279dbcc0ae40815"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:21.164700Z","signature_b64":"7p42eeNcVwFCRFDjyD5Gmw92deUfyCIbHeqluyo7wBMJSth65i65rlM6YxhvuvbZ1fMjQlQI/Vt/tJMVWQdfDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc21f5344ba0d2adad997a122b13fd7664e96b191a1e6a241fae1f0ee8909845","last_reissued_at":"2026-05-18T00:14:21.164212Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:21.164212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Lagrangian Dual Based Approach to Sparse Linear Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Chen Zhao, Houduo Qi, Naihua Xiu, Weiyue Li, Ziyan Luo","submitted_at":"2018-05-30T13:34:44Z","abstract_excerpt":"A sparse linear programming (SLP) problem is a linear programming problem equipped with a sparsity (or cardinality) constraint, which is nonconvex and discontinuous theoretically and generally NP-hard computationally due to the combinatorial property involved. By rewriting the sparsity constraint into a disjunctive form, we present an explicit formula of its Lagrangian dual in terms of an unconstrained piecewise-linear convex programming problem which admits a strong duality. A semi-proximal alternating direction method of multipliers (sPADMM) is then proposed to solve this dual problem by tak"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.11942","kind":"arxiv","version":2},"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":"1805.11942","created_at":"2026-05-18T00:14:21.164284+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.11942v2","created_at":"2026-05-18T00:14:21.164284+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.11942","created_at":"2026-05-18T00:14:21.164284+00:00"},{"alias_kind":"pith_short_12","alias_value":"XQQ7KNCLUDJK","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"XQQ7KNCLUDJK3LMZ","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"XQQ7KNCL","created_at":"2026-05-18T12:33:01.666342+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/XQQ7KNCLUDJK3LMZPIJCWE75OZ","json":"https://pith.science/pith/XQQ7KNCLUDJK3LMZPIJCWE75OZ.json","graph_json":"https://pith.science/api/pith-number/XQQ7KNCLUDJK3LMZPIJCWE75OZ/graph.json","events_json":"https://pith.science/api/pith-number/XQQ7KNCLUDJK3LMZPIJCWE75OZ/events.json","paper":"https://pith.science/paper/XQQ7KNCL"},"agent_actions":{"view_html":"https://pith.science/pith/XQQ7KNCLUDJK3LMZPIJCWE75OZ","download_json":"https://pith.science/pith/XQQ7KNCLUDJK3LMZPIJCWE75OZ.json","view_paper":"https://pith.science/paper/XQQ7KNCL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.11942&json=true","fetch_graph":"https://pith.science/api/pith-number/XQQ7KNCLUDJK3LMZPIJCWE75OZ/graph.json","fetch_events":"https://pith.science/api/pith-number/XQQ7KNCLUDJK3LMZPIJCWE75OZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XQQ7KNCLUDJK3LMZPIJCWE75OZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XQQ7KNCLUDJK3LMZPIJCWE75OZ/action/storage_attestation","attest_author":"https://pith.science/pith/XQQ7KNCLUDJK3LMZPIJCWE75OZ/action/author_attestation","sign_citation":"https://pith.science/pith/XQQ7KNCLUDJK3LMZPIJCWE75OZ/action/citation_signature","submit_replication":"https://pith.science/pith/XQQ7KNCLUDJK3LMZPIJCWE75OZ/action/replication_record"}},"created_at":"2026-05-18T00:14:21.164284+00:00","updated_at":"2026-05-18T00:14:21.164284+00:00"}