{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:X5OXE4CCLLZC43TZRGNF5UAZ44","short_pith_number":"pith:X5OXE4CC","canonical_record":{"source":{"id":"2211.16341","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-11-29T16:23:53Z","cross_cats_sorted":[],"title_canon_sha256":"5f21f93b6ae48248121d296dee1d42734ab13eb300aa62cd2b8d9c53368a24f3","abstract_canon_sha256":"1e0a315b4f107a4055c2dea1c96265e7a9624d4f71a26627560dd1a26b61cd97"},"schema_version":"1.0"},"canonical_sha256":"bf5d7270425af22e6e79899a5ed019e7281dc3e35be80a02ed94730abbe52bf8","source":{"kind":"arxiv","id":"2211.16341","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.16341","created_at":"2026-07-05T10:14:34Z"},{"alias_kind":"arxiv_version","alias_value":"2211.16341v1","created_at":"2026-07-05T10:14:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.16341","created_at":"2026-07-05T10:14:34Z"},{"alias_kind":"pith_short_12","alias_value":"X5OXE4CCLLZC","created_at":"2026-07-05T10:14:34Z"},{"alias_kind":"pith_short_16","alias_value":"X5OXE4CCLLZC43TZ","created_at":"2026-07-05T10:14:34Z"},{"alias_kind":"pith_short_8","alias_value":"X5OXE4CC","created_at":"2026-07-05T10:14:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:X5OXE4CCLLZC43TZRGNF5UAZ44","target":"record","payload":{"canonical_record":{"source":{"id":"2211.16341","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-11-29T16:23:53Z","cross_cats_sorted":[],"title_canon_sha256":"5f21f93b6ae48248121d296dee1d42734ab13eb300aa62cd2b8d9c53368a24f3","abstract_canon_sha256":"1e0a315b4f107a4055c2dea1c96265e7a9624d4f71a26627560dd1a26b61cd97"},"schema_version":"1.0"},"canonical_sha256":"bf5d7270425af22e6e79899a5ed019e7281dc3e35be80a02ed94730abbe52bf8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:14:34.785187Z","signature_b64":"6TfUQpOhDqo8RTfcid7hHDV5/jpH8hgxztnhIVV9aJlN1VrbX7H48UsjRFqwNIZ0Ws0V/x0toia1wHXoQcb8Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf5d7270425af22e6e79899a5ed019e7281dc3e35be80a02ed94730abbe52bf8","last_reissued_at":"2026-07-05T10:14:34.784689Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:14:34.784689Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2211.16341","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-07-05T10:14:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S/FK5gEK1GPj5fZzsQyyw3CTvjAj1pzt7UsE4lSr+GZDKfXcUBbLi9laiA8TVgLyTjJMfZbPrit5KC4+R5F+Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T16:35:11.065901Z"},"content_sha256":"de08ca50757f761dea00dc4183f734d3d155924f58e02928f87614cb9f8deae1","schema_version":"1.0","event_id":"sha256:de08ca50757f761dea00dc4183f734d3d155924f58e02928f87614cb9f8deae1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:X5OXE4CCLLZC43TZRGNF5UAZ44","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"LCQPow -- A Solver for Linear Complementarity Quadratic Programs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Armin Nurkanovic, Florian Messerer, Jonas Hall, Moritz Diehl","submitted_at":"2022-11-29T16:23:53Z","abstract_excerpt":"In this paper we introduce an open-source software package written in C++ for efficiently finding solutions to quadratic programming problems with linear complementarity constraints. These problems arise in a wide range of applications in engineering and economics, and they are challenging to solve due to their structural violation of standard constraint qualifications, and highly nonconvex, nonsmooth feasible sets. This work extends a previously presented algorithm based on a sequential convex programming approach applied to a standard penalty reformulation. We examine the behavior of local c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.16341","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/2211.16341/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"},"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-07-05T10:14:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W+GszvCzghoRCUeCC70JP5dqAQad/z+vn7ht8cDAk54p7wq+8dxilm0PlYpOMxP6pI5diGsBI6WMKg+mXtZsCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T16:35:11.066321Z"},"content_sha256":"243a0bcf8a559ad1cf8eafa17e867220ed8ab51dfbb99f02b61f21e588c20fa8","schema_version":"1.0","event_id":"sha256:243a0bcf8a559ad1cf8eafa17e867220ed8ab51dfbb99f02b61f21e588c20fa8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X5OXE4CCLLZC43TZRGNF5UAZ44/bundle.json","state_url":"https://pith.science/pith/X5OXE4CCLLZC43TZRGNF5UAZ44/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X5OXE4CCLLZC43TZRGNF5UAZ44/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-08-03T16:35:11Z","links":{"resolver":"https://pith.science/pith/X5OXE4CCLLZC43TZRGNF5UAZ44","bundle":"https://pith.science/pith/X5OXE4CCLLZC43TZRGNF5UAZ44/bundle.json","state":"https://pith.science/pith/X5OXE4CCLLZC43TZRGNF5UAZ44/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X5OXE4CCLLZC43TZRGNF5UAZ44/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:X5OXE4CCLLZC43TZRGNF5UAZ44","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":"1e0a315b4f107a4055c2dea1c96265e7a9624d4f71a26627560dd1a26b61cd97","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-11-29T16:23:53Z","title_canon_sha256":"5f21f93b6ae48248121d296dee1d42734ab13eb300aa62cd2b8d9c53368a24f3"},"schema_version":"1.0","source":{"id":"2211.16341","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.16341","created_at":"2026-07-05T10:14:34Z"},{"alias_kind":"arxiv_version","alias_value":"2211.16341v1","created_at":"2026-07-05T10:14:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.16341","created_at":"2026-07-05T10:14:34Z"},{"alias_kind":"pith_short_12","alias_value":"X5OXE4CCLLZC","created_at":"2026-07-05T10:14:34Z"},{"alias_kind":"pith_short_16","alias_value":"X5OXE4CCLLZC43TZ","created_at":"2026-07-05T10:14:34Z"},{"alias_kind":"pith_short_8","alias_value":"X5OXE4CC","created_at":"2026-07-05T10:14:34Z"}],"graph_snapshots":[{"event_id":"sha256:243a0bcf8a559ad1cf8eafa17e867220ed8ab51dfbb99f02b61f21e588c20fa8","target":"graph","created_at":"2026-07-05T10:14:34Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2211.16341/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper we introduce an open-source software package written in C++ for efficiently finding solutions to quadratic programming problems with linear complementarity constraints. These problems arise in a wide range of applications in engineering and economics, and they are challenging to solve due to their structural violation of standard constraint qualifications, and highly nonconvex, nonsmooth feasible sets. This work extends a previously presented algorithm based on a sequential convex programming approach applied to a standard penalty reformulation. We examine the behavior of local c","authors_text":"Armin Nurkanovic, Florian Messerer, Jonas Hall, Moritz Diehl","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-11-29T16:23:53Z","title":"LCQPow -- A Solver for Linear Complementarity Quadratic Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.16341","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:de08ca50757f761dea00dc4183f734d3d155924f58e02928f87614cb9f8deae1","target":"record","created_at":"2026-07-05T10:14:34Z","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":"1e0a315b4f107a4055c2dea1c96265e7a9624d4f71a26627560dd1a26b61cd97","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-11-29T16:23:53Z","title_canon_sha256":"5f21f93b6ae48248121d296dee1d42734ab13eb300aa62cd2b8d9c53368a24f3"},"schema_version":"1.0","source":{"id":"2211.16341","kind":"arxiv","version":1}},"canonical_sha256":"bf5d7270425af22e6e79899a5ed019e7281dc3e35be80a02ed94730abbe52bf8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bf5d7270425af22e6e79899a5ed019e7281dc3e35be80a02ed94730abbe52bf8","first_computed_at":"2026-07-05T10:14:34.784689Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:14:34.784689Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6TfUQpOhDqo8RTfcid7hHDV5/jpH8hgxztnhIVV9aJlN1VrbX7H48UsjRFqwNIZ0Ws0V/x0toia1wHXoQcb8Ag==","signature_status":"signed_v1","signed_at":"2026-07-05T10:14:34.785187Z","signed_message":"canonical_sha256_bytes"},"source_id":"2211.16341","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:de08ca50757f761dea00dc4183f734d3d155924f58e02928f87614cb9f8deae1","sha256:243a0bcf8a559ad1cf8eafa17e867220ed8ab51dfbb99f02b61f21e588c20fa8"],"state_sha256":"098b54ea81d634c264014ced34bbf8f183d132285b0d357724584fae49b9d637"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pX6Mnnm4DDbm0X3vjNhAtMB8j83Plblyqkvtlors1ckFiD5AsS4dcHIWhvDy2GkuvVJxQ7yROIyYlVGlRSQJDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T16:35:11.069252Z","bundle_sha256":"d3bffe5dc2e462dcd1be0b489dd260c46b7a34c86e1b7cfdf3f9953914380ec1"}}