{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:VUGYAGRMDOV67AKUV7YQWRQ7NX","short_pith_number":"pith:VUGYAGRM","canonical_record":{"source":{"id":"1810.09243","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-22T13:15:41Z","cross_cats_sorted":[],"title_canon_sha256":"62214b5ef8f7eaa814b0b887a0c3764bf4000b66c8180d40b04ad459c9f16429","abstract_canon_sha256":"fb224e2a6c50a671746eefd02d983b563778999168698c6bbade1a13c50ce42f"},"schema_version":"1.0"},"canonical_sha256":"ad0d801a2c1babef8154aff10b461f6ddb9b1e093a0f7b1599c96399cefdfbeb","source":{"kind":"arxiv","id":"1810.09243","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.09243","created_at":"2026-05-18T00:02:40Z"},{"alias_kind":"arxiv_version","alias_value":"1810.09243v1","created_at":"2026-05-18T00:02:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.09243","created_at":"2026-05-18T00:02:40Z"},{"alias_kind":"pith_short_12","alias_value":"VUGYAGRMDOV6","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VUGYAGRMDOV67AKU","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VUGYAGRM","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:VUGYAGRMDOV67AKUV7YQWRQ7NX","target":"record","payload":{"canonical_record":{"source":{"id":"1810.09243","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-22T13:15:41Z","cross_cats_sorted":[],"title_canon_sha256":"62214b5ef8f7eaa814b0b887a0c3764bf4000b66c8180d40b04ad459c9f16429","abstract_canon_sha256":"fb224e2a6c50a671746eefd02d983b563778999168698c6bbade1a13c50ce42f"},"schema_version":"1.0"},"canonical_sha256":"ad0d801a2c1babef8154aff10b461f6ddb9b1e093a0f7b1599c96399cefdfbeb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:40.729083Z","signature_b64":"9/Xvq0FSHg3KWHMV/EsAGjgtrWv89snOFwv8gDVDYV4nZW57unEn46fZws0e/+ppLnjZ1YICGbierVSwTsfmAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad0d801a2c1babef8154aff10b461f6ddb9b1e093a0f7b1599c96399cefdfbeb","last_reissued_at":"2026-05-18T00:02:40.728474Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:40.728474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.09243","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-05-18T00:02:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PH3B0b96gOP21tY3ORjzfOnHJ7ECP8AxMG10JGLGJR+4DISmb4vm6pDo6j/UHAii5xRctUKbnNcSAj57kOEJDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:38:41.679173Z"},"content_sha256":"72f8478942d59d2e7805b9d6500ae6bd23ad7375ece090e3c25c0d75bcf93151","schema_version":"1.0","event_id":"sha256:72f8478942d59d2e7805b9d6500ae6bd23ad7375ece090e3c25c0d75bcf93151"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:VUGYAGRMDOV67AKUV7YQWRQ7NX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Constraint-Reduced MPC Algorithm for Convex Quadratic Programming, with a Modified Active Set Identification Scheme","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andr\\'e L. Tits, M. Paul Laiu","submitted_at":"2018-10-22T13:15:41Z","abstract_excerpt":"A constraint-reduced Mehrotra-Predictor-Corrector algorithm for convex quadratic programming is proposed. (At each iteration, such algorithms use only a subset of the inequality constraints in constructing the search direction, resulting in CPU savings.) The proposed algorithm makes use of a regularization scheme to cater to cases where the reduced constraint matrix is rank deficient. Global and local convergence properties are established under arbitrary working-set selection rules subject to satisfaction of a general condition. A modified active-set identification scheme that fulfills this c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.09243","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":""},"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:02:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UWs3UkPIFDq6cRFksOpBDkumg4PnTFwZEoGkg9gbojd5m7hFfFNHGlQt8x7CQywzczq2BL3bRpStkzlBH5S5Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:38:41.679525Z"},"content_sha256":"bfc849f2f53430a0c87e2919c2675b1a9df90999694f6428501f2b89865ff887","schema_version":"1.0","event_id":"sha256:bfc849f2f53430a0c87e2919c2675b1a9df90999694f6428501f2b89865ff887"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VUGYAGRMDOV67AKUV7YQWRQ7NX/bundle.json","state_url":"https://pith.science/pith/VUGYAGRMDOV67AKUV7YQWRQ7NX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VUGYAGRMDOV67AKUV7YQWRQ7NX/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-06-05T12:38:41Z","links":{"resolver":"https://pith.science/pith/VUGYAGRMDOV67AKUV7YQWRQ7NX","bundle":"https://pith.science/pith/VUGYAGRMDOV67AKUV7YQWRQ7NX/bundle.json","state":"https://pith.science/pith/VUGYAGRMDOV67AKUV7YQWRQ7NX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VUGYAGRMDOV67AKUV7YQWRQ7NX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:VUGYAGRMDOV67AKUV7YQWRQ7NX","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":"fb224e2a6c50a671746eefd02d983b563778999168698c6bbade1a13c50ce42f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-22T13:15:41Z","title_canon_sha256":"62214b5ef8f7eaa814b0b887a0c3764bf4000b66c8180d40b04ad459c9f16429"},"schema_version":"1.0","source":{"id":"1810.09243","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.09243","created_at":"2026-05-18T00:02:40Z"},{"alias_kind":"arxiv_version","alias_value":"1810.09243v1","created_at":"2026-05-18T00:02:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.09243","created_at":"2026-05-18T00:02:40Z"},{"alias_kind":"pith_short_12","alias_value":"VUGYAGRMDOV6","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VUGYAGRMDOV67AKU","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VUGYAGRM","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:bfc849f2f53430a0c87e2919c2675b1a9df90999694f6428501f2b89865ff887","target":"graph","created_at":"2026-05-18T00:02:40Z","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 constraint-reduced Mehrotra-Predictor-Corrector algorithm for convex quadratic programming is proposed. (At each iteration, such algorithms use only a subset of the inequality constraints in constructing the search direction, resulting in CPU savings.) The proposed algorithm makes use of a regularization scheme to cater to cases where the reduced constraint matrix is rank deficient. Global and local convergence properties are established under arbitrary working-set selection rules subject to satisfaction of a general condition. A modified active-set identification scheme that fulfills this c","authors_text":"Andr\\'e L. Tits, M. Paul Laiu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-22T13:15:41Z","title":"A Constraint-Reduced MPC Algorithm for Convex Quadratic Programming, with a Modified Active Set Identification Scheme"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.09243","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:72f8478942d59d2e7805b9d6500ae6bd23ad7375ece090e3c25c0d75bcf93151","target":"record","created_at":"2026-05-18T00:02:40Z","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":"fb224e2a6c50a671746eefd02d983b563778999168698c6bbade1a13c50ce42f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-22T13:15:41Z","title_canon_sha256":"62214b5ef8f7eaa814b0b887a0c3764bf4000b66c8180d40b04ad459c9f16429"},"schema_version":"1.0","source":{"id":"1810.09243","kind":"arxiv","version":1}},"canonical_sha256":"ad0d801a2c1babef8154aff10b461f6ddb9b1e093a0f7b1599c96399cefdfbeb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ad0d801a2c1babef8154aff10b461f6ddb9b1e093a0f7b1599c96399cefdfbeb","first_computed_at":"2026-05-18T00:02:40.728474Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:40.728474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9/Xvq0FSHg3KWHMV/EsAGjgtrWv89snOFwv8gDVDYV4nZW57unEn46fZws0e/+ppLnjZ1YICGbierVSwTsfmAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:40.729083Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.09243","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:72f8478942d59d2e7805b9d6500ae6bd23ad7375ece090e3c25c0d75bcf93151","sha256:bfc849f2f53430a0c87e2919c2675b1a9df90999694f6428501f2b89865ff887"],"state_sha256":"255ff35e1f2e412cc0c2186511f1c091e29d0f9da20cda8ca7b35f74dd88543c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f5sarcyZ+IMcb5Mznz+5vZOeHq2lHp/BlLaDUJm2FiJG2OJ1dsTIGD4247d3++0yOzsNSPjJypI8PXrkuMVlBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T12:38:41.681380Z","bundle_sha256":"cf9b899cf1ba45c1b322fd686d6b2108c1d107515a08c8e778d0c2d84e470608"}}