{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:7J4B2GZ6J6H7G6ATZSVEQOWVAC","short_pith_number":"pith:7J4B2GZ6","canonical_record":{"source":{"id":"1308.1174","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-08-06T03:36:43Z","cross_cats_sorted":[],"title_canon_sha256":"118216b2557ff50855233fdf570992894e918df3f40ea081ebdc84f0edb93ff1","abstract_canon_sha256":"7c96a3a944deaf10b73e3c903aa354c131a18aa346a416e7cce977ed9210293a"},"schema_version":"1.0"},"canonical_sha256":"fa781d1b3e4f8ff37813ccaa483ad500afab183056c8dbc015e34e0e3ddc08ac","source":{"kind":"arxiv","id":"1308.1174","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.1174","created_at":"2026-05-18T03:11:59Z"},{"alias_kind":"arxiv_version","alias_value":"1308.1174v2","created_at":"2026-05-18T03:11:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.1174","created_at":"2026-05-18T03:11:59Z"},{"alias_kind":"pith_short_12","alias_value":"7J4B2GZ6J6H7","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7J4B2GZ6J6H7G6AT","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7J4B2GZ6","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:7J4B2GZ6J6H7G6ATZSVEQOWVAC","target":"record","payload":{"canonical_record":{"source":{"id":"1308.1174","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-08-06T03:36:43Z","cross_cats_sorted":[],"title_canon_sha256":"118216b2557ff50855233fdf570992894e918df3f40ea081ebdc84f0edb93ff1","abstract_canon_sha256":"7c96a3a944deaf10b73e3c903aa354c131a18aa346a416e7cce977ed9210293a"},"schema_version":"1.0"},"canonical_sha256":"fa781d1b3e4f8ff37813ccaa483ad500afab183056c8dbc015e34e0e3ddc08ac","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:59.047199Z","signature_b64":"NPOMIP+VgnHyLRyq+vEQo3BoAluKvrB5LEqTunjYJh7fKp0GBU0QWnizxh/dgznK6u559fxeASTsCcopXZHOCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa781d1b3e4f8ff37813ccaa483ad500afab183056c8dbc015e34e0e3ddc08ac","last_reissued_at":"2026-05-18T03:11:59.046587Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:59.046587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.1174","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-05-18T03:11:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zv6r+RF61OdWsisOEFZ9FLIW1mwnXVgrcW8MWGJ/OgJ3WwxpvJ9F0xTe+GPOXCxNM3GEJq08A06bMhjWe/HPCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T16:55:59.653221Z"},"content_sha256":"38c05258c4e619faff6ce160be563a6d0de62a4e2685dbcd3ff9c66d3ce9dea7","schema_version":"1.0","event_id":"sha256:38c05258c4e619faff6ce160be563a6d0de62a4e2685dbcd3ff9c66d3ce9dea7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:7J4B2GZ6J6H7G6ATZSVEQOWVAC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Anytime computation algorithms for approach-evasion differential games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Emilio Frazzoli, Erich Mueller, Minghui Zhu, Sertac Karaman","submitted_at":"2013-08-06T03:36:43Z","abstract_excerpt":"This paper studies a class of approach-evasion differential games, in which one player aims to steer the state of a dynamic system to the given target set in minimum time, while avoiding some set of disallowed states, and the other player desires to achieve the opposite. We propose a class of novel anytime computation algorithms, analyze their convergence properties and verify their performance via a number of numerical simulations. Our algorithms significantly outperform the multi-grid method for the approach-evasion differential games both theoretically and numerically. Our technical approac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.1174","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":""},"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:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"50BzY3Og0xWFmQsMwNEJc4cT3gESlzJ5AjpgxJGW+/at+QTJ0SjQHzd+9z04ZIFELoMalERlszYy8aAvPRYzDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T16:55:59.653993Z"},"content_sha256":"a5b10e00319374828d3eec5047b2399ec08bbb54156858fcfa17f580213b5157","schema_version":"1.0","event_id":"sha256:a5b10e00319374828d3eec5047b2399ec08bbb54156858fcfa17f580213b5157"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7J4B2GZ6J6H7G6ATZSVEQOWVAC/bundle.json","state_url":"https://pith.science/pith/7J4B2GZ6J6H7G6ATZSVEQOWVAC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7J4B2GZ6J6H7G6ATZSVEQOWVAC/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-11T16:55:59Z","links":{"resolver":"https://pith.science/pith/7J4B2GZ6J6H7G6ATZSVEQOWVAC","bundle":"https://pith.science/pith/7J4B2GZ6J6H7G6ATZSVEQOWVAC/bundle.json","state":"https://pith.science/pith/7J4B2GZ6J6H7G6ATZSVEQOWVAC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7J4B2GZ6J6H7G6ATZSVEQOWVAC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:7J4B2GZ6J6H7G6ATZSVEQOWVAC","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":"7c96a3a944deaf10b73e3c903aa354c131a18aa346a416e7cce977ed9210293a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-08-06T03:36:43Z","title_canon_sha256":"118216b2557ff50855233fdf570992894e918df3f40ea081ebdc84f0edb93ff1"},"schema_version":"1.0","source":{"id":"1308.1174","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.1174","created_at":"2026-05-18T03:11:59Z"},{"alias_kind":"arxiv_version","alias_value":"1308.1174v2","created_at":"2026-05-18T03:11:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.1174","created_at":"2026-05-18T03:11:59Z"},{"alias_kind":"pith_short_12","alias_value":"7J4B2GZ6J6H7","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7J4B2GZ6J6H7G6AT","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7J4B2GZ6","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:a5b10e00319374828d3eec5047b2399ec08bbb54156858fcfa17f580213b5157","target":"graph","created_at":"2026-05-18T03:11:59Z","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":"This paper studies a class of approach-evasion differential games, in which one player aims to steer the state of a dynamic system to the given target set in minimum time, while avoiding some set of disallowed states, and the other player desires to achieve the opposite. We propose a class of novel anytime computation algorithms, analyze their convergence properties and verify their performance via a number of numerical simulations. Our algorithms significantly outperform the multi-grid method for the approach-evasion differential games both theoretically and numerically. Our technical approac","authors_text":"Emilio Frazzoli, Erich Mueller, Minghui Zhu, Sertac Karaman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-08-06T03:36:43Z","title":"Anytime computation algorithms for approach-evasion differential games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.1174","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:38c05258c4e619faff6ce160be563a6d0de62a4e2685dbcd3ff9c66d3ce9dea7","target":"record","created_at":"2026-05-18T03:11:59Z","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":"7c96a3a944deaf10b73e3c903aa354c131a18aa346a416e7cce977ed9210293a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-08-06T03:36:43Z","title_canon_sha256":"118216b2557ff50855233fdf570992894e918df3f40ea081ebdc84f0edb93ff1"},"schema_version":"1.0","source":{"id":"1308.1174","kind":"arxiv","version":2}},"canonical_sha256":"fa781d1b3e4f8ff37813ccaa483ad500afab183056c8dbc015e34e0e3ddc08ac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fa781d1b3e4f8ff37813ccaa483ad500afab183056c8dbc015e34e0e3ddc08ac","first_computed_at":"2026-05-18T03:11:59.046587Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:11:59.046587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NPOMIP+VgnHyLRyq+vEQo3BoAluKvrB5LEqTunjYJh7fKp0GBU0QWnizxh/dgznK6u559fxeASTsCcopXZHOCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:11:59.047199Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.1174","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:38c05258c4e619faff6ce160be563a6d0de62a4e2685dbcd3ff9c66d3ce9dea7","sha256:a5b10e00319374828d3eec5047b2399ec08bbb54156858fcfa17f580213b5157"],"state_sha256":"64dcbc2f8594263b6cc5ea99948ef0fdf72aefde18b798da69e8b3d275fb61bd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tlhDbFsAnjD0KIHBnH5MSc5EfyO6e9Lvbb9hy+9Ld4maMd3uLHFiXTKodvw2o0qV1sUf15roKWIsNB9Ft9kmBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T16:55:59.657978Z","bundle_sha256":"7cba449d5d6a25a423031ff7b21eaac8462f61ecbc270227c6c3f79958ce4c4e"}}