{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:QFB6D75K56KGSFZCMIKUWCZZI5","short_pith_number":"pith:QFB6D75K","canonical_record":{"source":{"id":"1401.7882","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-01-30T15:29:48Z","cross_cats_sorted":[],"title_canon_sha256":"f4ed41cd2236d18de3af7103dfe14b1d7d5475877ff0e88871605b2018b5af7c","abstract_canon_sha256":"c16a2054924a343a5470e76fd1b7d2af94980f7f2bfee96703c95baa5d8325ab"},"schema_version":"1.0"},"canonical_sha256":"8143e1ffaaef9469172262154b0b3947743c305a14b41d08980329f377c258fc","source":{"kind":"arxiv","id":"1401.7882","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.7882","created_at":"2026-05-18T03:00:38Z"},{"alias_kind":"arxiv_version","alias_value":"1401.7882v1","created_at":"2026-05-18T03:00:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.7882","created_at":"2026-05-18T03:00:38Z"},{"alias_kind":"pith_short_12","alias_value":"QFB6D75K56KG","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"QFB6D75K56KGSFZC","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"QFB6D75K","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:QFB6D75K56KGSFZCMIKUWCZZI5","target":"record","payload":{"canonical_record":{"source":{"id":"1401.7882","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-01-30T15:29:48Z","cross_cats_sorted":[],"title_canon_sha256":"f4ed41cd2236d18de3af7103dfe14b1d7d5475877ff0e88871605b2018b5af7c","abstract_canon_sha256":"c16a2054924a343a5470e76fd1b7d2af94980f7f2bfee96703c95baa5d8325ab"},"schema_version":"1.0"},"canonical_sha256":"8143e1ffaaef9469172262154b0b3947743c305a14b41d08980329f377c258fc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:38.074355Z","signature_b64":"yL8IUkvi1KEXZoQw8HpP83xRwif7BRxtwUK/ND2NQFo66HGCr6uwv4h4BQNw6HhqfuI6Wl0h47sMXooEA6zjAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8143e1ffaaef9469172262154b0b3947743c305a14b41d08980329f377c258fc","last_reissued_at":"2026-05-18T03:00:38.073639Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:38.073639Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.7882","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-18T03:00:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g1nfUHXr3XL7UUcNpBjFc9+cJwAk9k6pEPpd2sMGBDlJ/n2G0FwCEa16dcOyPkpuSID4I+mUSQL9JbnBHUYjCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T21:30:49.967334Z"},"content_sha256":"4e41090abaed28b348491aeb759c9570f65ba90f9e19a156ce07228e7836ab7d","schema_version":"1.0","event_id":"sha256:4e41090abaed28b348491aeb759c9570f65ba90f9e19a156ce07228e7836ab7d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:QFB6D75K56KGSFZCMIKUWCZZI5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An O(log N) Parallel Algorithm for Newton Step Computation in Model Predictive Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Daniel Axehill, Isak Nielsen","submitted_at":"2014-01-30T15:29:48Z","abstract_excerpt":"The use of Model Predictive Control in industry is steadily increasing as more complicated problems can be addressed. Due to that online optimization is usually performed, the main bottleneck with Model Predictive Control is the relatively high computational complexity. Hence, a lot of research has been performed to find efficient algorithms that solve the optimization problem. As parallelism is becoming more commonly used in hardware, the demand for efficient parallel solvers for Model Predictive Control has increased. In this paper, a tailored parallel algorithm that can adopt different leve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.7882","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-18T03:00:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U46OEMncMjEszCj4DXQ/aaWwZ87U/IRKKVfyNiTSsmktsw0zQF8gO92q2OdqRxJoZvI73MHZaCXh9bQnYuPvDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T21:30:49.968083Z"},"content_sha256":"29dc68490059031848502158c872a376fec1b348bb087445d08b0027f97db593","schema_version":"1.0","event_id":"sha256:29dc68490059031848502158c872a376fec1b348bb087445d08b0027f97db593"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QFB6D75K56KGSFZCMIKUWCZZI5/bundle.json","state_url":"https://pith.science/pith/QFB6D75K56KGSFZCMIKUWCZZI5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QFB6D75K56KGSFZCMIKUWCZZI5/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-11T21:30:49Z","links":{"resolver":"https://pith.science/pith/QFB6D75K56KGSFZCMIKUWCZZI5","bundle":"https://pith.science/pith/QFB6D75K56KGSFZCMIKUWCZZI5/bundle.json","state":"https://pith.science/pith/QFB6D75K56KGSFZCMIKUWCZZI5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QFB6D75K56KGSFZCMIKUWCZZI5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:QFB6D75K56KGSFZCMIKUWCZZI5","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":"c16a2054924a343a5470e76fd1b7d2af94980f7f2bfee96703c95baa5d8325ab","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-01-30T15:29:48Z","title_canon_sha256":"f4ed41cd2236d18de3af7103dfe14b1d7d5475877ff0e88871605b2018b5af7c"},"schema_version":"1.0","source":{"id":"1401.7882","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.7882","created_at":"2026-05-18T03:00:38Z"},{"alias_kind":"arxiv_version","alias_value":"1401.7882v1","created_at":"2026-05-18T03:00:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.7882","created_at":"2026-05-18T03:00:38Z"},{"alias_kind":"pith_short_12","alias_value":"QFB6D75K56KG","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"QFB6D75K56KGSFZC","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"QFB6D75K","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:29dc68490059031848502158c872a376fec1b348bb087445d08b0027f97db593","target":"graph","created_at":"2026-05-18T03:00:38Z","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":"The use of Model Predictive Control in industry is steadily increasing as more complicated problems can be addressed. Due to that online optimization is usually performed, the main bottleneck with Model Predictive Control is the relatively high computational complexity. Hence, a lot of research has been performed to find efficient algorithms that solve the optimization problem. As parallelism is becoming more commonly used in hardware, the demand for efficient parallel solvers for Model Predictive Control has increased. In this paper, a tailored parallel algorithm that can adopt different leve","authors_text":"Daniel Axehill, Isak Nielsen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-01-30T15:29:48Z","title":"An O(log N) Parallel Algorithm for Newton Step Computation in Model Predictive Control"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.7882","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:4e41090abaed28b348491aeb759c9570f65ba90f9e19a156ce07228e7836ab7d","target":"record","created_at":"2026-05-18T03:00:38Z","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":"c16a2054924a343a5470e76fd1b7d2af94980f7f2bfee96703c95baa5d8325ab","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-01-30T15:29:48Z","title_canon_sha256":"f4ed41cd2236d18de3af7103dfe14b1d7d5475877ff0e88871605b2018b5af7c"},"schema_version":"1.0","source":{"id":"1401.7882","kind":"arxiv","version":1}},"canonical_sha256":"8143e1ffaaef9469172262154b0b3947743c305a14b41d08980329f377c258fc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8143e1ffaaef9469172262154b0b3947743c305a14b41d08980329f377c258fc","first_computed_at":"2026-05-18T03:00:38.073639Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:00:38.073639Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yL8IUkvi1KEXZoQw8HpP83xRwif7BRxtwUK/ND2NQFo66HGCr6uwv4h4BQNw6HhqfuI6Wl0h47sMXooEA6zjAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:00:38.074355Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.7882","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4e41090abaed28b348491aeb759c9570f65ba90f9e19a156ce07228e7836ab7d","sha256:29dc68490059031848502158c872a376fec1b348bb087445d08b0027f97db593"],"state_sha256":"802f5268f3a63c425fabd5f0f7acf86db374fd5037f25cf5d33b1ed210f79614"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e5VjIgUDyeOR0aJfEqbIhVFefCDFv0BcWT2jfDzXif9swSI2JNQ1L2DwmGb/bfmudV7OIBHybWkt/GkfFAOXCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T21:30:49.971961Z","bundle_sha256":"3f4e5458f714c2522c7e7808eb2a97b9e3c140405aaaa72d202d59650fa05c27"}}