{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:NF5AS7NPTPN2PEAVB2W5MCVYWS","short_pith_number":"pith:NF5AS7NP","canonical_record":{"source":{"id":"1809.06360","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-17T17:54:23Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"389593c457ef33f1ecb00930c981ff1737e293e140cab0041b574779fb84fb8f","abstract_canon_sha256":"0ca632a7a38681c04de6e27ac483baf6686fec161025771245502e4d22ef4bea"},"schema_version":"1.0"},"canonical_sha256":"697a097daf9bdba790150eadd60ab8b4ace46351dd27fd4a4e28d431d4dd22e6","source":{"kind":"arxiv","id":"1809.06360","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.06360","created_at":"2026-05-18T00:05:34Z"},{"alias_kind":"arxiv_version","alias_value":"1809.06360v1","created_at":"2026-05-18T00:05:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.06360","created_at":"2026-05-18T00:05:34Z"},{"alias_kind":"pith_short_12","alias_value":"NF5AS7NPTPN2","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NF5AS7NPTPN2PEAV","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NF5AS7NP","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:NF5AS7NPTPN2PEAVB2W5MCVYWS","target":"record","payload":{"canonical_record":{"source":{"id":"1809.06360","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-17T17:54:23Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"389593c457ef33f1ecb00930c981ff1737e293e140cab0041b574779fb84fb8f","abstract_canon_sha256":"0ca632a7a38681c04de6e27ac483baf6686fec161025771245502e4d22ef4bea"},"schema_version":"1.0"},"canonical_sha256":"697a097daf9bdba790150eadd60ab8b4ace46351dd27fd4a4e28d431d4dd22e6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:34.927552Z","signature_b64":"+kTrgIgxjRRQpZbvtmplGGlZCDw6REu3unp6SVjSdhmdifWJ+JHQERO8hYBvP2fUqxB8GhAnfsGXgMCGRhvDBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"697a097daf9bdba790150eadd60ab8b4ace46351dd27fd4a4e28d431d4dd22e6","last_reissued_at":"2026-05-18T00:05:34.927026Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:34.927026Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.06360","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:05:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6xnRxgKCAsfqg/Lm2WrLjQieoni7uGjiCsEcxrBYobD9gxQIZYs1oNjGzKTjT2tf7NtoCeD9MBA72dHgXIkmDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T09:13:12.817482Z"},"content_sha256":"c8612be6f6bc381b36da6d74b3315cd242d0dfdbabe4f05d6c0e0cfd4fd5bbe3","schema_version":"1.0","event_id":"sha256:c8612be6f6bc381b36da6d74b3315cd242d0dfdbabe4f05d6c0e0cfd4fd5bbe3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:NF5AS7NPTPN2PEAVB2W5MCVYWS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Parallelization of Riccati Recursion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"math.OC","authors_text":"Claire Tomlin, Forrest Laine","submitted_at":"2018-09-17T17:54:23Z","abstract_excerpt":"A method is presented for parallelizing the computation of solutions to discrete-time, linear-quadratic, finite-horizon optimal control problems, which we will refer to as LQR problems. This class of problem arises frequently in robotic trajectory optimization. For very complicated robots, the size of these resulting problems can be large enough that computing the solution is prohibitively slow when using a single processor. Fortunately, approaches to solving these type of problems based on numerical solutions to the KKT conditions of optimality offer a parallel solution method and can leverag"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.06360","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:05:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8DT8/f1qO2xt1arrcLqTcSuz8l+r9rMCMLpKFBGJrF8Z6aEWfE3QWkf4kcZGsL8+Jh7E9bnKve9SXxwgFPXvBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T09:13:12.817822Z"},"content_sha256":"57952377cee5caf1d3f32b5ad7b12b0b9361c48352b969cfea374238a74a58c8","schema_version":"1.0","event_id":"sha256:57952377cee5caf1d3f32b5ad7b12b0b9361c48352b969cfea374238a74a58c8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NF5AS7NPTPN2PEAVB2W5MCVYWS/bundle.json","state_url":"https://pith.science/pith/NF5AS7NPTPN2PEAVB2W5MCVYWS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NF5AS7NPTPN2PEAVB2W5MCVYWS/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-27T09:13:12Z","links":{"resolver":"https://pith.science/pith/NF5AS7NPTPN2PEAVB2W5MCVYWS","bundle":"https://pith.science/pith/NF5AS7NPTPN2PEAVB2W5MCVYWS/bundle.json","state":"https://pith.science/pith/NF5AS7NPTPN2PEAVB2W5MCVYWS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NF5AS7NPTPN2PEAVB2W5MCVYWS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NF5AS7NPTPN2PEAVB2W5MCVYWS","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":"0ca632a7a38681c04de6e27ac483baf6686fec161025771245502e4d22ef4bea","cross_cats_sorted":["cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-17T17:54:23Z","title_canon_sha256":"389593c457ef33f1ecb00930c981ff1737e293e140cab0041b574779fb84fb8f"},"schema_version":"1.0","source":{"id":"1809.06360","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.06360","created_at":"2026-05-18T00:05:34Z"},{"alias_kind":"arxiv_version","alias_value":"1809.06360v1","created_at":"2026-05-18T00:05:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.06360","created_at":"2026-05-18T00:05:34Z"},{"alias_kind":"pith_short_12","alias_value":"NF5AS7NPTPN2","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NF5AS7NPTPN2PEAV","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NF5AS7NP","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:57952377cee5caf1d3f32b5ad7b12b0b9361c48352b969cfea374238a74a58c8","target":"graph","created_at":"2026-05-18T00:05: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"},"paper":{"abstract_excerpt":"A method is presented for parallelizing the computation of solutions to discrete-time, linear-quadratic, finite-horizon optimal control problems, which we will refer to as LQR problems. This class of problem arises frequently in robotic trajectory optimization. For very complicated robots, the size of these resulting problems can be large enough that computing the solution is prohibitively slow when using a single processor. Fortunately, approaches to solving these type of problems based on numerical solutions to the KKT conditions of optimality offer a parallel solution method and can leverag","authors_text":"Claire Tomlin, Forrest Laine","cross_cats":["cs.RO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-17T17:54:23Z","title":"The Parallelization of Riccati Recursion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.06360","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:c8612be6f6bc381b36da6d74b3315cd242d0dfdbabe4f05d6c0e0cfd4fd5bbe3","target":"record","created_at":"2026-05-18T00:05: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":"0ca632a7a38681c04de6e27ac483baf6686fec161025771245502e4d22ef4bea","cross_cats_sorted":["cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-17T17:54:23Z","title_canon_sha256":"389593c457ef33f1ecb00930c981ff1737e293e140cab0041b574779fb84fb8f"},"schema_version":"1.0","source":{"id":"1809.06360","kind":"arxiv","version":1}},"canonical_sha256":"697a097daf9bdba790150eadd60ab8b4ace46351dd27fd4a4e28d431d4dd22e6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"697a097daf9bdba790150eadd60ab8b4ace46351dd27fd4a4e28d431d4dd22e6","first_computed_at":"2026-05-18T00:05:34.927026Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:34.927026Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+kTrgIgxjRRQpZbvtmplGGlZCDw6REu3unp6SVjSdhmdifWJ+JHQERO8hYBvP2fUqxB8GhAnfsGXgMCGRhvDBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:34.927552Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.06360","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c8612be6f6bc381b36da6d74b3315cd242d0dfdbabe4f05d6c0e0cfd4fd5bbe3","sha256:57952377cee5caf1d3f32b5ad7b12b0b9361c48352b969cfea374238a74a58c8"],"state_sha256":"365b9c7c33b3a79d4c42e9dbcf562ad9402e3fff20ec60d4cb7c44f288e5df5a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EqoaJYlmnlAtnpNiwLGsqMDy70BylglEqB06jrmwG299iOF1lKeSNE/PxLKcc9nWaEWFdB+kbb1L+oPHOzLoAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T09:13:12.819684Z","bundle_sha256":"1b1ec5808240c8c3785f501393dd3cf16b4eb28f9bdbdfd5004e8d867b61188b"}}