{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:P5GLMUOH775BI7AU576SH4VGKF","short_pith_number":"pith:P5GLMUOH","canonical_record":{"source":{"id":"2502.12005","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-02-17T16:42:09Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"9015fe553277f16860af24fdef5ee9a2ae901c6ed6d660890e2e39a9a16cfdab","abstract_canon_sha256":"71bb8cdbe2fdf27f6e0fc57fb36096f872794aa90672d0c6404a6b49435dd616"},"schema_version":"1.0"},"canonical_sha256":"7f4cb651c7fffa147c14effd23f2a65179b7c994979b50cffde1b3bacf54b981","source":{"kind":"arxiv","id":"2502.12005","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.12005","created_at":"2026-07-05T10:41:52Z"},{"alias_kind":"arxiv_version","alias_value":"2502.12005v2","created_at":"2026-07-05T10:41:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.12005","created_at":"2026-07-05T10:41:52Z"},{"alias_kind":"pith_short_12","alias_value":"P5GLMUOH775B","created_at":"2026-07-05T10:41:52Z"},{"alias_kind":"pith_short_16","alias_value":"P5GLMUOH775BI7AU","created_at":"2026-07-05T10:41:52Z"},{"alias_kind":"pith_short_8","alias_value":"P5GLMUOH","created_at":"2026-07-05T10:41:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:P5GLMUOH775BI7AU576SH4VGKF","target":"record","payload":{"canonical_record":{"source":{"id":"2502.12005","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-02-17T16:42:09Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"9015fe553277f16860af24fdef5ee9a2ae901c6ed6d660890e2e39a9a16cfdab","abstract_canon_sha256":"71bb8cdbe2fdf27f6e0fc57fb36096f872794aa90672d0c6404a6b49435dd616"},"schema_version":"1.0"},"canonical_sha256":"7f4cb651c7fffa147c14effd23f2a65179b7c994979b50cffde1b3bacf54b981","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:41:52.544118Z","signature_b64":"hrnH8ClrVEq9859tZhytYbVASB/M5KxWCuC+HPSPjk5C+T7BObm41FIVmvQO8mw9ap2Hy3L3SiWXZQzO3QEJCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f4cb651c7fffa147c14effd23f2a65179b7c994979b50cffde1b3bacf54b981","last_reissued_at":"2026-07-05T10:41:52.543613Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:41:52.543613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.12005","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-07-05T10:41:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2p/NLLgPZtabiBrY/XkgnTRLDky7WhzUCQfNWqxLfvO+07ShPjy18mgQCu2d4UCLiodJKTNXTsLuUdN7twUAAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T10:20:18.864333Z"},"content_sha256":"dce561533efa3160d618877c8acc5088293b8e58dfccc9990cd37f8889a0d943","schema_version":"1.0","event_id":"sha256:dce561533efa3160d618877c8acc5088293b8e58dfccc9990cd37f8889a0d943"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:P5GLMUOH775BI7AU576SH4VGKF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Feasibility Evaluation of Quadratic Programs for Constrained Control","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Dimitra Panagou, Panagiotis Rousseas","submitted_at":"2025-02-17T16:42:09Z","abstract_excerpt":"This paper presents a computationally-efficient method for evaluating the feasibility of Quadratic Programs (QPs) for online constrained control. Based on the duality principle, we first show that the feasibility of a QP can be determined by the solution of a properly-defined Linear Program (LP). Our analysis yields a LP that can be solved more efficiently compared to the original QP problem, and more importantly, is simpler in form and can be solved more efficiently compared to existing methods that assess feasibility via LPs. The computational efficiency of the proposed method compared to ex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.12005","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.12005/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:41:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"72vtCEh5VIxgyNFt7Zu0AREHV3QoCUDZZLNfKy6xm79vn2Jv23xrc69VmDy7hO2NlQ5CkSH/q5bCMbaUwbAqBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T10:20:18.864730Z"},"content_sha256":"e1216fa7b1364878a8d81be2d3786b3b2827dfadd4704786b2a13fe16c67af61","schema_version":"1.0","event_id":"sha256:e1216fa7b1364878a8d81be2d3786b3b2827dfadd4704786b2a13fe16c67af61"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P5GLMUOH775BI7AU576SH4VGKF/bundle.json","state_url":"https://pith.science/pith/P5GLMUOH775BI7AU576SH4VGKF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P5GLMUOH775BI7AU576SH4VGKF/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-20T10:20:18Z","links":{"resolver":"https://pith.science/pith/P5GLMUOH775BI7AU576SH4VGKF","bundle":"https://pith.science/pith/P5GLMUOH775BI7AU576SH4VGKF/bundle.json","state":"https://pith.science/pith/P5GLMUOH775BI7AU576SH4VGKF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P5GLMUOH775BI7AU576SH4VGKF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:P5GLMUOH775BI7AU576SH4VGKF","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":"71bb8cdbe2fdf27f6e0fc57fb36096f872794aa90672d0c6404a6b49435dd616","cross_cats_sorted":["cs.SY","eess.SY"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-02-17T16:42:09Z","title_canon_sha256":"9015fe553277f16860af24fdef5ee9a2ae901c6ed6d660890e2e39a9a16cfdab"},"schema_version":"1.0","source":{"id":"2502.12005","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.12005","created_at":"2026-07-05T10:41:52Z"},{"alias_kind":"arxiv_version","alias_value":"2502.12005v2","created_at":"2026-07-05T10:41:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.12005","created_at":"2026-07-05T10:41:52Z"},{"alias_kind":"pith_short_12","alias_value":"P5GLMUOH775B","created_at":"2026-07-05T10:41:52Z"},{"alias_kind":"pith_short_16","alias_value":"P5GLMUOH775BI7AU","created_at":"2026-07-05T10:41:52Z"},{"alias_kind":"pith_short_8","alias_value":"P5GLMUOH","created_at":"2026-07-05T10:41:52Z"}],"graph_snapshots":[{"event_id":"sha256:e1216fa7b1364878a8d81be2d3786b3b2827dfadd4704786b2a13fe16c67af61","target":"graph","created_at":"2026-07-05T10:41:52Z","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/2502.12005/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper presents a computationally-efficient method for evaluating the feasibility of Quadratic Programs (QPs) for online constrained control. Based on the duality principle, we first show that the feasibility of a QP can be determined by the solution of a properly-defined Linear Program (LP). Our analysis yields a LP that can be solved more efficiently compared to the original QP problem, and more importantly, is simpler in form and can be solved more efficiently compared to existing methods that assess feasibility via LPs. The computational efficiency of the proposed method compared to ex","authors_text":"Dimitra Panagou, Panagiotis Rousseas","cross_cats":["cs.SY","eess.SY"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-02-17T16:42:09Z","title":"Feasibility Evaluation of Quadratic Programs for Constrained Control"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.12005","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:dce561533efa3160d618877c8acc5088293b8e58dfccc9990cd37f8889a0d943","target":"record","created_at":"2026-07-05T10:41:52Z","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":"71bb8cdbe2fdf27f6e0fc57fb36096f872794aa90672d0c6404a6b49435dd616","cross_cats_sorted":["cs.SY","eess.SY"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-02-17T16:42:09Z","title_canon_sha256":"9015fe553277f16860af24fdef5ee9a2ae901c6ed6d660890e2e39a9a16cfdab"},"schema_version":"1.0","source":{"id":"2502.12005","kind":"arxiv","version":2}},"canonical_sha256":"7f4cb651c7fffa147c14effd23f2a65179b7c994979b50cffde1b3bacf54b981","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7f4cb651c7fffa147c14effd23f2a65179b7c994979b50cffde1b3bacf54b981","first_computed_at":"2026-07-05T10:41:52.543613Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:41:52.543613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hrnH8ClrVEq9859tZhytYbVASB/M5KxWCuC+HPSPjk5C+T7BObm41FIVmvQO8mw9ap2Hy3L3SiWXZQzO3QEJCA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:41:52.544118Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.12005","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dce561533efa3160d618877c8acc5088293b8e58dfccc9990cd37f8889a0d943","sha256:e1216fa7b1364878a8d81be2d3786b3b2827dfadd4704786b2a13fe16c67af61"],"state_sha256":"b4769e2bf26f9e85c50199abc9a7c61c55ab581bc262920b859f4708a76bd487"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RZiuIbdSqReCJ8zMjPpOag8Xn6PF+rCGT5KzPGTBj9Z8ENGmArvKyj6OaVKI41vzdo6Dok4QqSJdSgt26ZvnDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T10:20:18.867531Z","bundle_sha256":"45cfdb428a95fe14b4a15d6fbd5939dc6df7ebf0dc17112ca2ccf120502abe2a"}}