{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:FZEX6W6P6HWOH7IAJPO276XDPL","short_pith_number":"pith:FZEX6W6P","schema_version":"1.0","canonical_sha256":"2e497f5bcff1ece3fd004bddaffae37af3613e3b0b3cc2864eea9966a32a9275","source":{"kind":"arxiv","id":"1302.6431","version":2},"attestation_state":"computed","paper":{"title":"A decomposition technique for pursuit evasion games with many pursuers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AP"],"primary_cat":"math.OC","authors_text":"Adriano Festa, Richard B. Vinter","submitted_at":"2013-02-26T13:45:04Z","abstract_excerpt":"Here we present a decomposition technique for a class of differential games. The technique consists in a decomposition of the target set which produces, for geometrical reasons, a decomposition in the dimensionality of the problem. Using some elements of Hamilton-Jacobi equations theory, we find a relation between the regularity of the solution and the possibility to decompose the problem. We use this technique to solve a pursuit evasion game with multiple agents."},"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":"1302.6431","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-02-26T13:45:04Z","cross_cats_sorted":["math.AP"],"title_canon_sha256":"b0a06d4a08a0f4baac3439626384a2f9d677eecf5c292ccf3ac4e7132b253577","abstract_canon_sha256":"8afb73d1dc410b1c934e733872496d1fdd0b2b9ba49a55db98e66d3c5102d974"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:31:06.167623Z","signature_b64":"X0CJsKYBsR+3jQDDZ0SqUu8cDW37wx+RlUy3reJcqFIvnKArAgS/CahP1BXLbVdHii30OxGGfGVG/4EZW9DbBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e497f5bcff1ece3fd004bddaffae37af3613e3b0b3cc2864eea9966a32a9275","last_reissued_at":"2026-05-18T03:31:06.166896Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:31:06.166896Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A decomposition technique for pursuit evasion games with many pursuers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AP"],"primary_cat":"math.OC","authors_text":"Adriano Festa, Richard B. Vinter","submitted_at":"2013-02-26T13:45:04Z","abstract_excerpt":"Here we present a decomposition technique for a class of differential games. The technique consists in a decomposition of the target set which produces, for geometrical reasons, a decomposition in the dimensionality of the problem. Using some elements of Hamilton-Jacobi equations theory, we find a relation between the regularity of the solution and the possibility to decompose the problem. We use this technique to solve a pursuit evasion game with multiple agents."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.6431","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":"1302.6431","created_at":"2026-05-18T03:31:06.167018+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.6431v2","created_at":"2026-05-18T03:31:06.167018+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.6431","created_at":"2026-05-18T03:31:06.167018+00:00"},{"alias_kind":"pith_short_12","alias_value":"FZEX6W6P6HWO","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"FZEX6W6P6HWOH7IA","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"FZEX6W6P","created_at":"2026-05-18T12:27:45.050594+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/FZEX6W6P6HWOH7IAJPO276XDPL","json":"https://pith.science/pith/FZEX6W6P6HWOH7IAJPO276XDPL.json","graph_json":"https://pith.science/api/pith-number/FZEX6W6P6HWOH7IAJPO276XDPL/graph.json","events_json":"https://pith.science/api/pith-number/FZEX6W6P6HWOH7IAJPO276XDPL/events.json","paper":"https://pith.science/paper/FZEX6W6P"},"agent_actions":{"view_html":"https://pith.science/pith/FZEX6W6P6HWOH7IAJPO276XDPL","download_json":"https://pith.science/pith/FZEX6W6P6HWOH7IAJPO276XDPL.json","view_paper":"https://pith.science/paper/FZEX6W6P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.6431&json=true","fetch_graph":"https://pith.science/api/pith-number/FZEX6W6P6HWOH7IAJPO276XDPL/graph.json","fetch_events":"https://pith.science/api/pith-number/FZEX6W6P6HWOH7IAJPO276XDPL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FZEX6W6P6HWOH7IAJPO276XDPL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FZEX6W6P6HWOH7IAJPO276XDPL/action/storage_attestation","attest_author":"https://pith.science/pith/FZEX6W6P6HWOH7IAJPO276XDPL/action/author_attestation","sign_citation":"https://pith.science/pith/FZEX6W6P6HWOH7IAJPO276XDPL/action/citation_signature","submit_replication":"https://pith.science/pith/FZEX6W6P6HWOH7IAJPO276XDPL/action/replication_record"}},"created_at":"2026-05-18T03:31:06.167018+00:00","updated_at":"2026-05-18T03:31:06.167018+00:00"}