{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ZON22X6V7MS3H5IW5Q3YUF3ECH","short_pith_number":"pith:ZON22X6V","canonical_record":{"source":{"id":"1310.0064","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-09-30T21:30:02Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"0270899cc3636292305bb54075cc1ae5742cdf26e7d6bb52d44d28f282c81dd7","abstract_canon_sha256":"ff5dc689303b3826f885712003996a17828b8fd8bfc82a480831b07fee9ae2c2"},"schema_version":"1.0"},"canonical_sha256":"cb9bad5fd5fb25b3f516ec378a176411efac09378f916cfe667540a7d8ef6983","source":{"kind":"arxiv","id":"1310.0064","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.0064","created_at":"2026-05-18T03:11:45Z"},{"alias_kind":"arxiv_version","alias_value":"1310.0064v1","created_at":"2026-05-18T03:11:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.0064","created_at":"2026-05-18T03:11:45Z"},{"alias_kind":"pith_short_12","alias_value":"ZON22X6V7MS3","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZON22X6V7MS3H5IW","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZON22X6V","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ZON22X6V7MS3H5IW5Q3YUF3ECH","target":"record","payload":{"canonical_record":{"source":{"id":"1310.0064","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-09-30T21:30:02Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"0270899cc3636292305bb54075cc1ae5742cdf26e7d6bb52d44d28f282c81dd7","abstract_canon_sha256":"ff5dc689303b3826f885712003996a17828b8fd8bfc82a480831b07fee9ae2c2"},"schema_version":"1.0"},"canonical_sha256":"cb9bad5fd5fb25b3f516ec378a176411efac09378f916cfe667540a7d8ef6983","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:45.757848Z","signature_b64":"T3j1PzrU+RYy5+g3d/Az7wr9iKeg6zW4nF2Up38Sqwet1UCJPJYpkY16bE21famwhPS3ulVRN13v1TGcHd25DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb9bad5fd5fb25b3f516ec378a176411efac09378f916cfe667540a7d8ef6983","last_reissued_at":"2026-05-18T03:11:45.757188Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:45.757188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.0064","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:11:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pat9lJESlYL+oTVaIYIH581rdjqRYnXCxAexpX3SS0mQzhu1QnY0pdTcAQtPdmJ/cmi1qtHR7dc3YKQH16FVDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T14:31:36.514277Z"},"content_sha256":"396bdbe57ea9ed015b45e223bd199b193be34be958ec26fe745f04d60a6f1a71","schema_version":"1.0","event_id":"sha256:396bdbe57ea9ed015b45e223bd199b193be34be958ec26fe745f04d60a6f1a71"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ZON22X6V7MS3H5IW5Q3YUF3ECH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Approximate Optimal Path-Following for a Kinematic Unicycle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.SY","authors_text":"Lindsey Andrews, Patrick Walters, Rushikesh Kamalapurkar, Warren E. Dixon","submitted_at":"2013-09-30T21:30:02Z","abstract_excerpt":"Online approximation of an infinite horizon optimal path-following strategy for a kinematic unicycle is considered. The solution to the optimal control problem is approximated using an approximate dynamic programming technique that uses concurrent-learning-based adaptive update laws to estimate the unknown value function. The developed controller overcomes challenges with the approximation of the infinite horizon value function using an auxiliary function that describes the motion of a virtual target on the desired path. The developed controller guarantees uniformly ultimately bounded (UUB) co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.0064","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:11:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dGYsamQ/LiKQIeKcieKfa7zEAZURkcqpNuVs9XDernJWNyZj5LklTF07rMb8cV3z7oNcvXtsc8hPhimw09DKAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T14:31:36.514652Z"},"content_sha256":"256fcdef824a86b8fa2e7bcd48d71ab79f54b81c83e273baf1c1dd96742f9edf","schema_version":"1.0","event_id":"sha256:256fcdef824a86b8fa2e7bcd48d71ab79f54b81c83e273baf1c1dd96742f9edf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZON22X6V7MS3H5IW5Q3YUF3ECH/bundle.json","state_url":"https://pith.science/pith/ZON22X6V7MS3H5IW5Q3YUF3ECH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZON22X6V7MS3H5IW5Q3YUF3ECH/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-11T14:31:36Z","links":{"resolver":"https://pith.science/pith/ZON22X6V7MS3H5IW5Q3YUF3ECH","bundle":"https://pith.science/pith/ZON22X6V7MS3H5IW5Q3YUF3ECH/bundle.json","state":"https://pith.science/pith/ZON22X6V7MS3H5IW5Q3YUF3ECH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZON22X6V7MS3H5IW5Q3YUF3ECH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ZON22X6V7MS3H5IW5Q3YUF3ECH","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":"ff5dc689303b3826f885712003996a17828b8fd8bfc82a480831b07fee9ae2c2","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-09-30T21:30:02Z","title_canon_sha256":"0270899cc3636292305bb54075cc1ae5742cdf26e7d6bb52d44d28f282c81dd7"},"schema_version":"1.0","source":{"id":"1310.0064","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.0064","created_at":"2026-05-18T03:11:45Z"},{"alias_kind":"arxiv_version","alias_value":"1310.0064v1","created_at":"2026-05-18T03:11:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.0064","created_at":"2026-05-18T03:11:45Z"},{"alias_kind":"pith_short_12","alias_value":"ZON22X6V7MS3","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZON22X6V7MS3H5IW","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZON22X6V","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:256fcdef824a86b8fa2e7bcd48d71ab79f54b81c83e273baf1c1dd96742f9edf","target":"graph","created_at":"2026-05-18T03:11:45Z","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":"Online approximation of an infinite horizon optimal path-following strategy for a kinematic unicycle is considered. The solution to the optimal control problem is approximated using an approximate dynamic programming technique that uses concurrent-learning-based adaptive update laws to estimate the unknown value function. The developed controller overcomes challenges with the approximation of the infinite horizon value function using an auxiliary function that describes the motion of a virtual target on the desired path. The developed controller guarantees uniformly ultimately bounded (UUB) co","authors_text":"Lindsey Andrews, Patrick Walters, Rushikesh Kamalapurkar, Warren E. Dixon","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-09-30T21:30:02Z","title":"Online Approximate Optimal Path-Following for a Kinematic Unicycle"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.0064","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:396bdbe57ea9ed015b45e223bd199b193be34be958ec26fe745f04d60a6f1a71","target":"record","created_at":"2026-05-18T03:11:45Z","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":"ff5dc689303b3826f885712003996a17828b8fd8bfc82a480831b07fee9ae2c2","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-09-30T21:30:02Z","title_canon_sha256":"0270899cc3636292305bb54075cc1ae5742cdf26e7d6bb52d44d28f282c81dd7"},"schema_version":"1.0","source":{"id":"1310.0064","kind":"arxiv","version":1}},"canonical_sha256":"cb9bad5fd5fb25b3f516ec378a176411efac09378f916cfe667540a7d8ef6983","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cb9bad5fd5fb25b3f516ec378a176411efac09378f916cfe667540a7d8ef6983","first_computed_at":"2026-05-18T03:11:45.757188Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:11:45.757188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T3j1PzrU+RYy5+g3d/Az7wr9iKeg6zW4nF2Up38Sqwet1UCJPJYpkY16bE21famwhPS3ulVRN13v1TGcHd25DA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:11:45.757848Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.0064","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:396bdbe57ea9ed015b45e223bd199b193be34be958ec26fe745f04d60a6f1a71","sha256:256fcdef824a86b8fa2e7bcd48d71ab79f54b81c83e273baf1c1dd96742f9edf"],"state_sha256":"b3963a3720dc7d8247a5087b63ff1c856cfefdbb80ea16f6d345637f0233925d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SASf2Qlu09kr8qvNGeA0qwGZZV/UBRcPDNVc9MWK0AZN5QTC3PkUcpzwUTeFXojcgC0p/de5bVL1lk95tGflDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T14:31:36.516708Z","bundle_sha256":"08b0cc0d74cf53ec0fd06da876c062c435948cdd50fc90fc98330c9e6bb55d99"}}