{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:M73VURRKXS3LBVR27SIJHM5M5Y","short_pith_number":"pith:M73VURRK","canonical_record":{"source":{"id":"2003.02547","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-03-05T11:45:49Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"d66e0df48060d2e1c3111f913c7ade4925823a3d131a48f7678b32273e203725","abstract_canon_sha256":"ae9e9ace3574aaaed2a77f0a0a621360413ed21605b6b2c7a3a266917d499fe8"},"schema_version":"1.0"},"canonical_sha256":"67f75a462abcb6b0d63afc9093b3acee1ec8d88d896f2634ec6d5192f9a41716","source":{"kind":"arxiv","id":"2003.02547","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2003.02547","created_at":"2026-07-05T01:08:28Z"},{"alias_kind":"arxiv_version","alias_value":"2003.02547v2","created_at":"2026-07-05T01:08:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.02547","created_at":"2026-07-05T01:08:28Z"},{"alias_kind":"pith_short_12","alias_value":"M73VURRKXS3L","created_at":"2026-07-05T01:08:28Z"},{"alias_kind":"pith_short_16","alias_value":"M73VURRKXS3LBVR2","created_at":"2026-07-05T01:08:28Z"},{"alias_kind":"pith_short_8","alias_value":"M73VURRK","created_at":"2026-07-05T01:08:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:M73VURRKXS3LBVR27SIJHM5M5Y","target":"record","payload":{"canonical_record":{"source":{"id":"2003.02547","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-03-05T11:45:49Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"d66e0df48060d2e1c3111f913c7ade4925823a3d131a48f7678b32273e203725","abstract_canon_sha256":"ae9e9ace3574aaaed2a77f0a0a621360413ed21605b6b2c7a3a266917d499fe8"},"schema_version":"1.0"},"canonical_sha256":"67f75a462abcb6b0d63afc9093b3acee1ec8d88d896f2634ec6d5192f9a41716","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:08:28.362172Z","signature_b64":"GFGWQJ6VhIbaPPHJzBtzQ4YM80z3Ec/4FjqauGf8/gAevmv9+ebXhyYbViSycdN2a+M3DRZ6OBMe1vOWZZlYCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67f75a462abcb6b0d63afc9093b3acee1ec8d88d896f2634ec6d5192f9a41716","last_reissued_at":"2026-07-05T01:08:28.361684Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:08:28.361684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2003.02547","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-05T01:08:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kNefTZU5hLhSHllUNIEWJzzOZnJA+l8OIXoXO/s9nEyKkrCZJZeiWeWEpxUU3A99qoi4rJdVLyn07Awat/gvCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T06:44:32.551695Z"},"content_sha256":"5a1cffecbceb48a8b4947b359e737371e19348470fa849ebe9fd09f94d542851","schema_version":"1.0","event_id":"sha256:5a1cffecbceb48a8b4947b359e737371e19348470fa849ebe9fd09f94d542851"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:M73VURRKXS3LBVR27SIJHM5M5Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"HPIPM: a high-performance quadratic programming framework for model predictive control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Gianluca Frison, Moritz Diehl","submitted_at":"2020-03-05T11:45:49Z","abstract_excerpt":"This paper introduces HPIPM, a high-performance framework for quadratic programming (QP), designed to provide building blocks to efficiently and reliably solve model predictive control problems. HPIPM currently supports three QP types, and provides interior point method (IPM) solvers as well (partial) condensing routines. In particular, the IPM for optimal control QPs is intended to supersede the HPMPC solver, and it largely improves robustness while keeping the focus on speed. Numerical experiments show that HPIPM reliably solves challenging QPs, and that it outperforms other state-of-the-art"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.02547","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/2003.02547/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-05T01:08:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eVnuQ3uLol05vOxqbPIdMgZ8cTdWEikJSjpCPBxrQjP8QXaP/EttpsKQD9yPR7YW3xfPZGCXll9zdZgvSYtEAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T06:44:32.552647Z"},"content_sha256":"5e632b9485beb239b63deed69c2d08a784ea823448108c980d6d5ba1d105f78b","schema_version":"1.0","event_id":"sha256:5e632b9485beb239b63deed69c2d08a784ea823448108c980d6d5ba1d105f78b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M73VURRKXS3LBVR27SIJHM5M5Y/bundle.json","state_url":"https://pith.science/pith/M73VURRKXS3LBVR27SIJHM5M5Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M73VURRKXS3LBVR27SIJHM5M5Y/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-08T06:44:32Z","links":{"resolver":"https://pith.science/pith/M73VURRKXS3LBVR27SIJHM5M5Y","bundle":"https://pith.science/pith/M73VURRKXS3LBVR27SIJHM5M5Y/bundle.json","state":"https://pith.science/pith/M73VURRKXS3LBVR27SIJHM5M5Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M73VURRKXS3LBVR27SIJHM5M5Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:M73VURRKXS3LBVR27SIJHM5M5Y","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":"ae9e9ace3574aaaed2a77f0a0a621360413ed21605b6b2c7a3a266917d499fe8","cross_cats_sorted":["cs.SY","eess.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-03-05T11:45:49Z","title_canon_sha256":"d66e0df48060d2e1c3111f913c7ade4925823a3d131a48f7678b32273e203725"},"schema_version":"1.0","source":{"id":"2003.02547","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2003.02547","created_at":"2026-07-05T01:08:28Z"},{"alias_kind":"arxiv_version","alias_value":"2003.02547v2","created_at":"2026-07-05T01:08:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.02547","created_at":"2026-07-05T01:08:28Z"},{"alias_kind":"pith_short_12","alias_value":"M73VURRKXS3L","created_at":"2026-07-05T01:08:28Z"},{"alias_kind":"pith_short_16","alias_value":"M73VURRKXS3LBVR2","created_at":"2026-07-05T01:08:28Z"},{"alias_kind":"pith_short_8","alias_value":"M73VURRK","created_at":"2026-07-05T01:08:28Z"}],"graph_snapshots":[{"event_id":"sha256:5e632b9485beb239b63deed69c2d08a784ea823448108c980d6d5ba1d105f78b","target":"graph","created_at":"2026-07-05T01:08:28Z","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/2003.02547/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper introduces HPIPM, a high-performance framework for quadratic programming (QP), designed to provide building blocks to efficiently and reliably solve model predictive control problems. HPIPM currently supports three QP types, and provides interior point method (IPM) solvers as well (partial) condensing routines. In particular, the IPM for optimal control QPs is intended to supersede the HPMPC solver, and it largely improves robustness while keeping the focus on speed. Numerical experiments show that HPIPM reliably solves challenging QPs, and that it outperforms other state-of-the-art","authors_text":"Gianluca Frison, Moritz Diehl","cross_cats":["cs.SY","eess.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-03-05T11:45:49Z","title":"HPIPM: a high-performance quadratic programming framework for model predictive control"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.02547","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:5a1cffecbceb48a8b4947b359e737371e19348470fa849ebe9fd09f94d542851","target":"record","created_at":"2026-07-05T01:08:28Z","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":"ae9e9ace3574aaaed2a77f0a0a621360413ed21605b6b2c7a3a266917d499fe8","cross_cats_sorted":["cs.SY","eess.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-03-05T11:45:49Z","title_canon_sha256":"d66e0df48060d2e1c3111f913c7ade4925823a3d131a48f7678b32273e203725"},"schema_version":"1.0","source":{"id":"2003.02547","kind":"arxiv","version":2}},"canonical_sha256":"67f75a462abcb6b0d63afc9093b3acee1ec8d88d896f2634ec6d5192f9a41716","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"67f75a462abcb6b0d63afc9093b3acee1ec8d88d896f2634ec6d5192f9a41716","first_computed_at":"2026-07-05T01:08:28.361684Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:08:28.361684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GFGWQJ6VhIbaPPHJzBtzQ4YM80z3Ec/4FjqauGf8/gAevmv9+ebXhyYbViSycdN2a+M3DRZ6OBMe1vOWZZlYCA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:08:28.362172Z","signed_message":"canonical_sha256_bytes"},"source_id":"2003.02547","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5a1cffecbceb48a8b4947b359e737371e19348470fa849ebe9fd09f94d542851","sha256:5e632b9485beb239b63deed69c2d08a784ea823448108c980d6d5ba1d105f78b"],"state_sha256":"4f4322746b8bf491a341d05bc40398d22d57e5c0e93e250464c00b7707bd1298"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GAkp2hAKS2n8f97rQMEqesqnSvY3xBPB+aXxqRG5E/c+8tnZwkrJe7kFvUL0LzxBXiD7eR2J6ZoWgTDKmHDLCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T06:44:32.558420Z","bundle_sha256":"822c6716d220e8da63a424e774f8b3ddeb9bc5b56bfe412252529d22ef69bb55"}}