{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:JBLVCMQII64WWBSHPAQ2ZKY2ZI","short_pith_number":"pith:JBLVCMQI","schema_version":"1.0","canonical_sha256":"485751320847b96b06477821acab1aca234f5ddd29bf8075b5984fed2470a141","source":{"kind":"arxiv","id":"2606.03862","version":1},"attestation_state":"computed","paper":{"title":"APX-Hardness of Computing Lipschitz Constants for Multi-Parametric Quadratic Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.SY","math.OC"],"primary_cat":"eess.SY","authors_text":"Keyou You, Kunpeng Liu, Xingchen Li","submitted_at":"2026-06-02T16:35:43Z","abstract_excerpt":"Computing the Lipschitz constant of the solution map of a multi-parametric quadratic program is important for the analysis of optimization-based control. This problem is governed by three factors: the parameter dimension, the number of decision variables, and the number of constraints. While empirical evidence has long suggested exponential complexity, a rigorous complexity-theoretic proof has been lacking. In this paper, we fill this gap by proving that this problem is not only NP-hard but also APX-hard. Furthermore, we reveal that: (a) the problem becomes polynomial-time solvable when the nu"},"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":"2606.03862","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2026-06-02T16:35:43Z","cross_cats_sorted":["cs.CC","cs.SY","math.OC"],"title_canon_sha256":"b01ad0a7f3648cd361622e5d859c03c2c6b32ada0a52b799689870836308796a","abstract_canon_sha256":"821efef649fc66be136d4d7181c79e6eee5fb6be2da2df13409a098352d8c8e8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T02:06:04.569199Z","signature_b64":"n/qZOHpj0jRWDhw9QsFPm1AJuXrEeF+wjIXDO6mZbqLSprhVhZ4xviK5CPYwtt3YxEtpYCVc+ZaOdj0vTZq7AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"485751320847b96b06477821acab1aca234f5ddd29bf8075b5984fed2470a141","last_reissued_at":"2026-06-03T02:06:04.568843Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T02:06:04.568843Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"APX-Hardness of Computing Lipschitz Constants for Multi-Parametric Quadratic Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.SY","math.OC"],"primary_cat":"eess.SY","authors_text":"Keyou You, Kunpeng Liu, Xingchen Li","submitted_at":"2026-06-02T16:35:43Z","abstract_excerpt":"Computing the Lipschitz constant of the solution map of a multi-parametric quadratic program is important for the analysis of optimization-based control. This problem is governed by three factors: the parameter dimension, the number of decision variables, and the number of constraints. While empirical evidence has long suggested exponential complexity, a rigorous complexity-theoretic proof has been lacking. In this paper, we fill this gap by proving that this problem is not only NP-hard but also APX-hard. Furthermore, we reveal that: (a) the problem becomes polynomial-time solvable when the nu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.03862","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.03862/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2606.03862","created_at":"2026-06-03T02:06:04.568898+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.03862v1","created_at":"2026-06-03T02:06:04.568898+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.03862","created_at":"2026-06-03T02:06:04.568898+00:00"},{"alias_kind":"pith_short_12","alias_value":"JBLVCMQII64W","created_at":"2026-06-03T02:06:04.568898+00:00"},{"alias_kind":"pith_short_16","alias_value":"JBLVCMQII64WWBSH","created_at":"2026-06-03T02:06:04.568898+00:00"},{"alias_kind":"pith_short_8","alias_value":"JBLVCMQI","created_at":"2026-06-03T02:06:04.568898+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/JBLVCMQII64WWBSHPAQ2ZKY2ZI","json":"https://pith.science/pith/JBLVCMQII64WWBSHPAQ2ZKY2ZI.json","graph_json":"https://pith.science/api/pith-number/JBLVCMQII64WWBSHPAQ2ZKY2ZI/graph.json","events_json":"https://pith.science/api/pith-number/JBLVCMQII64WWBSHPAQ2ZKY2ZI/events.json","paper":"https://pith.science/paper/JBLVCMQI"},"agent_actions":{"view_html":"https://pith.science/pith/JBLVCMQII64WWBSHPAQ2ZKY2ZI","download_json":"https://pith.science/pith/JBLVCMQII64WWBSHPAQ2ZKY2ZI.json","view_paper":"https://pith.science/paper/JBLVCMQI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.03862&json=true","fetch_graph":"https://pith.science/api/pith-number/JBLVCMQII64WWBSHPAQ2ZKY2ZI/graph.json","fetch_events":"https://pith.science/api/pith-number/JBLVCMQII64WWBSHPAQ2ZKY2ZI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JBLVCMQII64WWBSHPAQ2ZKY2ZI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JBLVCMQII64WWBSHPAQ2ZKY2ZI/action/storage_attestation","attest_author":"https://pith.science/pith/JBLVCMQII64WWBSHPAQ2ZKY2ZI/action/author_attestation","sign_citation":"https://pith.science/pith/JBLVCMQII64WWBSHPAQ2ZKY2ZI/action/citation_signature","submit_replication":"https://pith.science/pith/JBLVCMQII64WWBSHPAQ2ZKY2ZI/action/replication_record"}},"created_at":"2026-06-03T02:06:04.568898+00:00","updated_at":"2026-06-03T02:06:04.568898+00:00"}