{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:XQQ7KNCLUDJK3LMZPIJCWE75OZ","short_pith_number":"pith:XQQ7KNCL","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"},"canonical_sha256":"bc21f5344ba0d2adad997a122b13fd7664e96b191a1e6a241fae1f0ee8909845","source":{"kind":"arxiv","id":"1805.11942","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.11942","created_at":"2026-05-18T00:14:21Z"},{"alias_kind":"arxiv_version","alias_value":"1805.11942v2","created_at":"2026-05-18T00:14:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.11942","created_at":"2026-05-18T00:14:21Z"},{"alias_kind":"pith_short_12","alias_value":"XQQ7KNCLUDJK","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XQQ7KNCLUDJK3LMZ","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XQQ7KNCL","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:XQQ7KNCLUDJK3LMZPIJCWE75OZ","target":"record","payload":{"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"},"canonical_sha256":"bc21f5344ba0d2adad997a122b13fd7664e96b191a1e6a241fae1f0ee8909845","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"},"source_kind":"arxiv","source_id":"1805.11942","source_version":2,"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:14:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7XDHJ/W32rKhX81TEtWqvQ01Xq9F8bSJqKywuJELgPjK/Y2RpXX/4eyAukH7k7XTaAucQ0PNyo6dBNpNNsD0AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:18:23.372618Z"},"content_sha256":"0f95d1d1fdfb117bbf9ec8e8c7619213420d7e16bc936919e8e267e07fa5a5a3","schema_version":"1.0","event_id":"sha256:0f95d1d1fdfb117bbf9ec8e8c7619213420d7e16bc936919e8e267e07fa5a5a3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:XQQ7KNCLUDJK3LMZPIJCWE75OZ","target":"graph","payload":{"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"},"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:14:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3kq2RLAz/at4gIeU3kkoewPaCoGDjWSrJtO/okUNfDMx7X43dBqFNDiDBUGMyYVClLoRTYygLPB1R4DoyDUABg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:18:23.373425Z"},"content_sha256":"319ffa9613e6b2161288ad6e7950ed9ece37bd818337778870f1423509e444b0","schema_version":"1.0","event_id":"sha256:319ffa9613e6b2161288ad6e7950ed9ece37bd818337778870f1423509e444b0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XQQ7KNCLUDJK3LMZPIJCWE75OZ/bundle.json","state_url":"https://pith.science/pith/XQQ7KNCLUDJK3LMZPIJCWE75OZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XQQ7KNCLUDJK3LMZPIJCWE75OZ/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-30T14:18:23Z","links":{"resolver":"https://pith.science/pith/XQQ7KNCLUDJK3LMZPIJCWE75OZ","bundle":"https://pith.science/pith/XQQ7KNCLUDJK3LMZPIJCWE75OZ/bundle.json","state":"https://pith.science/pith/XQQ7KNCLUDJK3LMZPIJCWE75OZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XQQ7KNCLUDJK3LMZPIJCWE75OZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:XQQ7KNCLUDJK3LMZPIJCWE75OZ","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":"e069a2a0ecee17231b317f3ea55cfc17b8e0135362e055f46279dbcc0ae40815","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-30T13:34:44Z","title_canon_sha256":"fc3811ede2b68440117aeb1a27078986fa34a4963a5749ee172ca144afe6ca1d"},"schema_version":"1.0","source":{"id":"1805.11942","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.11942","created_at":"2026-05-18T00:14:21Z"},{"alias_kind":"arxiv_version","alias_value":"1805.11942v2","created_at":"2026-05-18T00:14:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.11942","created_at":"2026-05-18T00:14:21Z"},{"alias_kind":"pith_short_12","alias_value":"XQQ7KNCLUDJK","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XQQ7KNCLUDJK3LMZ","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XQQ7KNCL","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:319ffa9613e6b2161288ad6e7950ed9ece37bd818337778870f1423509e444b0","target":"graph","created_at":"2026-05-18T00:14:21Z","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":"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","authors_text":"Chen Zhao, Houduo Qi, Naihua Xiu, Weiyue Li, Ziyan Luo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-30T13:34:44Z","title":"A Lagrangian Dual Based Approach to Sparse Linear Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.11942","kind":"arxiv","version":2},"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:0f95d1d1fdfb117bbf9ec8e8c7619213420d7e16bc936919e8e267e07fa5a5a3","target":"record","created_at":"2026-05-18T00:14:21Z","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":"e069a2a0ecee17231b317f3ea55cfc17b8e0135362e055f46279dbcc0ae40815","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-30T13:34:44Z","title_canon_sha256":"fc3811ede2b68440117aeb1a27078986fa34a4963a5749ee172ca144afe6ca1d"},"schema_version":"1.0","source":{"id":"1805.11942","kind":"arxiv","version":2}},"canonical_sha256":"bc21f5344ba0d2adad997a122b13fd7664e96b191a1e6a241fae1f0ee8909845","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bc21f5344ba0d2adad997a122b13fd7664e96b191a1e6a241fae1f0ee8909845","first_computed_at":"2026-05-18T00:14:21.164212Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:21.164212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7p42eeNcVwFCRFDjyD5Gmw92deUfyCIbHeqluyo7wBMJSth65i65rlM6YxhvuvbZ1fMjQlQI/Vt/tJMVWQdfDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:21.164700Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.11942","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0f95d1d1fdfb117bbf9ec8e8c7619213420d7e16bc936919e8e267e07fa5a5a3","sha256:319ffa9613e6b2161288ad6e7950ed9ece37bd818337778870f1423509e444b0"],"state_sha256":"efd11456004d0e7f6a6f4813fcc887a5635f0a54290bb870dcf43207457b22ef"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mC5SxQnfXHERvdDJ56ya20dgksP5tfjjsMBn2n2guEsRLVYRX4h16sHBROTMwRsFXi2IbtFG9BnY/JlZoA1OBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T14:18:23.377270Z","bundle_sha256":"1ed4105b8669d0027a275cabcac2afb69b6d5016d5f5fe5db724c0d68af830f6"}}