{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:7J4B2GZ6J6H7G6ATZSVEQOWVAC","short_pith_number":"pith:7J4B2GZ6","schema_version":"1.0","canonical_sha256":"fa781d1b3e4f8ff37813ccaa483ad500afab183056c8dbc015e34e0e3ddc08ac","source":{"kind":"arxiv","id":"1308.1174","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1308.1174","created_at":"2026-05-18T03:11:59.046688+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.1174v2","created_at":"2026-05-18T03:11:59.046688+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.1174","created_at":"2026-05-18T03:11:59.046688+00:00"},{"alias_kind":"pith_short_12","alias_value":"7J4B2GZ6J6H7","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"7J4B2GZ6J6H7G6AT","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"7J4B2GZ6","created_at":"2026-05-18T12:27:36.564083+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7J4B2GZ6J6H7G6ATZSVEQOWVAC","json":"https://pith.science/pith/7J4B2GZ6J6H7G6ATZSVEQOWVAC.json","graph_json":"https://pith.science/api/pith-number/7J4B2GZ6J6H7G6ATZSVEQOWVAC/graph.json","events_json":"https://pith.science/api/pith-number/7J4B2GZ6J6H7G6ATZSVEQOWVAC/events.json","paper":"https://pith.science/paper/7J4B2GZ6"},"agent_actions":{"view_html":"https://pith.science/pith/7J4B2GZ6J6H7G6ATZSVEQOWVAC","download_json":"https://pith.science/pith/7J4B2GZ6J6H7G6ATZSVEQOWVAC.json","view_paper":"https://pith.science/paper/7J4B2GZ6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.1174&json=true","fetch_graph":"https://pith.science/api/pith-number/7J4B2GZ6J6H7G6ATZSVEQOWVAC/graph.json","fetch_events":"https://pith.science/api/pith-number/7J4B2GZ6J6H7G6ATZSVEQOWVAC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7J4B2GZ6J6H7G6ATZSVEQOWVAC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7J4B2GZ6J6H7G6ATZSVEQOWVAC/action/storage_attestation","attest_author":"https://pith.science/pith/7J4B2GZ6J6H7G6ATZSVEQOWVAC/action/author_attestation","sign_citation":"https://pith.science/pith/7J4B2GZ6J6H7G6ATZSVEQOWVAC/action/citation_signature","submit_replication":"https://pith.science/pith/7J4B2GZ6J6H7G6ATZSVEQOWVAC/action/replication_record"}},"created_at":"2026-05-18T03:11:59.046688+00:00","updated_at":"2026-05-18T03:11:59.046688+00:00"}