{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:TM7P3O3OZ5OTUPUDNJ3D2OYKEI","short_pith_number":"pith:TM7P3O3O","canonical_record":{"source":{"id":"1809.08302","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-21T20:32:15Z","cross_cats_sorted":[],"title_canon_sha256":"1f105ca4dc56c39902b6e4b6566a7af4ca5722ec1c349dfafa49867624e91239","abstract_canon_sha256":"50a1c7b89eb20acb08a72cdd9280fb32bd74ea6dcf755ccb1a2e1bc78ca4cced"},"schema_version":"1.0"},"canonical_sha256":"9b3efdbb6ecf5d3a3e836a763d3b0a22235508293178a729d2b20b5d418decc0","source":{"kind":"arxiv","id":"1809.08302","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.08302","created_at":"2026-05-18T00:05:08Z"},{"alias_kind":"arxiv_version","alias_value":"1809.08302v1","created_at":"2026-05-18T00:05:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.08302","created_at":"2026-05-18T00:05:08Z"},{"alias_kind":"pith_short_12","alias_value":"TM7P3O3OZ5OT","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"TM7P3O3OZ5OTUPUD","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"TM7P3O3O","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:TM7P3O3OZ5OTUPUDNJ3D2OYKEI","target":"record","payload":{"canonical_record":{"source":{"id":"1809.08302","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-21T20:32:15Z","cross_cats_sorted":[],"title_canon_sha256":"1f105ca4dc56c39902b6e4b6566a7af4ca5722ec1c349dfafa49867624e91239","abstract_canon_sha256":"50a1c7b89eb20acb08a72cdd9280fb32bd74ea6dcf755ccb1a2e1bc78ca4cced"},"schema_version":"1.0"},"canonical_sha256":"9b3efdbb6ecf5d3a3e836a763d3b0a22235508293178a729d2b20b5d418decc0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:08.893708Z","signature_b64":"+Enu+3yfASdGDMgC+asM29KzI5niaslZ8njMv6wacmKkDaCD0svmeRpGMXv3YaaE6MM6AXhrQD1OZwTsltFFBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b3efdbb6ecf5d3a3e836a763d3b0a22235508293178a729d2b20b5d418decc0","last_reissued_at":"2026-05-18T00:05:08.893255Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:08.893255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.08302","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:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qujk/v/MQFyL4izPvPAZ0YfTc4/HBCy5InFl4WvyvIMXTYc17vKF6afawcy7R1KMbEjFZi8pqTq9n0919kC/CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:26:44.765783Z"},"content_sha256":"4071dae9d36c6188b2acb0af31e0f11533e929b32adbccc3fab92a393f5c3b70","schema_version":"1.0","event_id":"sha256:4071dae9d36c6188b2acb0af31e0f11533e929b32adbccc3fab92a393f5c3b70"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:TM7P3O3OZ5OTUPUDNJ3D2OYKEI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Differential Dynamic Programming for Nonlinear Dynamic Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andrew Lamperski, Bolei Di","submitted_at":"2018-09-21T20:32:15Z","abstract_excerpt":"Dynamic games arise when multiple agents with differing objectives choose control inputs to a dynamic system. Dynamic games model a wide variety of applications in economics, defense, and energy systems. However, compared to single-agent control problems, the computational methods for dynamic games are relatively limited. As in the single-agent case, only very specialized dynamic games can be solved exactly, and so approximation algorithms are required. This paper extends the differential dynamic programming algorithm from single-agent control to the case of non-zero sum full-information dynam"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.08302","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:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NmYoo+JCaFSgK+gf2vRTLEMBiilmRHVf0U3/bYqVDUXOx7aIR14l0Tac6wfq9+TZWRCajT1c5foTLjnH0WKIAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:26:44.766133Z"},"content_sha256":"6d82fd8847e160e25585b4564c6c664fd0cac0e99c71deded41652e24891478d","schema_version":"1.0","event_id":"sha256:6d82fd8847e160e25585b4564c6c664fd0cac0e99c71deded41652e24891478d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TM7P3O3OZ5OTUPUDNJ3D2OYKEI/bundle.json","state_url":"https://pith.science/pith/TM7P3O3OZ5OTUPUDNJ3D2OYKEI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TM7P3O3OZ5OTUPUDNJ3D2OYKEI/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-02T17:26:44Z","links":{"resolver":"https://pith.science/pith/TM7P3O3OZ5OTUPUDNJ3D2OYKEI","bundle":"https://pith.science/pith/TM7P3O3OZ5OTUPUDNJ3D2OYKEI/bundle.json","state":"https://pith.science/pith/TM7P3O3OZ5OTUPUDNJ3D2OYKEI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TM7P3O3OZ5OTUPUDNJ3D2OYKEI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:TM7P3O3OZ5OTUPUDNJ3D2OYKEI","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":"50a1c7b89eb20acb08a72cdd9280fb32bd74ea6dcf755ccb1a2e1bc78ca4cced","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-21T20:32:15Z","title_canon_sha256":"1f105ca4dc56c39902b6e4b6566a7af4ca5722ec1c349dfafa49867624e91239"},"schema_version":"1.0","source":{"id":"1809.08302","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.08302","created_at":"2026-05-18T00:05:08Z"},{"alias_kind":"arxiv_version","alias_value":"1809.08302v1","created_at":"2026-05-18T00:05:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.08302","created_at":"2026-05-18T00:05:08Z"},{"alias_kind":"pith_short_12","alias_value":"TM7P3O3OZ5OT","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"TM7P3O3OZ5OTUPUD","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"TM7P3O3O","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:6d82fd8847e160e25585b4564c6c664fd0cac0e99c71deded41652e24891478d","target":"graph","created_at":"2026-05-18T00:05:08Z","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":"Dynamic games arise when multiple agents with differing objectives choose control inputs to a dynamic system. Dynamic games model a wide variety of applications in economics, defense, and energy systems. However, compared to single-agent control problems, the computational methods for dynamic games are relatively limited. As in the single-agent case, only very specialized dynamic games can be solved exactly, and so approximation algorithms are required. This paper extends the differential dynamic programming algorithm from single-agent control to the case of non-zero sum full-information dynam","authors_text":"Andrew Lamperski, Bolei Di","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-21T20:32:15Z","title":"Differential Dynamic Programming for Nonlinear Dynamic Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.08302","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:4071dae9d36c6188b2acb0af31e0f11533e929b32adbccc3fab92a393f5c3b70","target":"record","created_at":"2026-05-18T00:05:08Z","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":"50a1c7b89eb20acb08a72cdd9280fb32bd74ea6dcf755ccb1a2e1bc78ca4cced","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-21T20:32:15Z","title_canon_sha256":"1f105ca4dc56c39902b6e4b6566a7af4ca5722ec1c349dfafa49867624e91239"},"schema_version":"1.0","source":{"id":"1809.08302","kind":"arxiv","version":1}},"canonical_sha256":"9b3efdbb6ecf5d3a3e836a763d3b0a22235508293178a729d2b20b5d418decc0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b3efdbb6ecf5d3a3e836a763d3b0a22235508293178a729d2b20b5d418decc0","first_computed_at":"2026-05-18T00:05:08.893255Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:08.893255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+Enu+3yfASdGDMgC+asM29KzI5niaslZ8njMv6wacmKkDaCD0svmeRpGMXv3YaaE6MM6AXhrQD1OZwTsltFFBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:08.893708Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.08302","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4071dae9d36c6188b2acb0af31e0f11533e929b32adbccc3fab92a393f5c3b70","sha256:6d82fd8847e160e25585b4564c6c664fd0cac0e99c71deded41652e24891478d"],"state_sha256":"6d95046b980e96d0168896ee2e17bf10b528762eacae66b01f15972f083e131d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ODjtjBpkYAb7ZcmMWJcb3XS5DIXpmZ2F3sYWqeavmuzTb7jGu6RcYWnHBRdoRR022WHvConIVe9+XkhWGlyWBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T17:26:44.768127Z","bundle_sha256":"544e1d5300f389cd30b3bd2927859822eceb10c57ed4ec1f343840e78eb35cdf"}}