{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:7N4U3OGVCK5HNHJAJJMOKQMX53","short_pith_number":"pith:7N4U3OGV","schema_version":"1.0","canonical_sha256":"fb794db8d512ba769d204a58e54197eefb2e232676c885a46305baf8f3e685f6","source":{"kind":"arxiv","id":"1411.2874","version":2},"attestation_state":"computed","paper":{"title":"The Cyclic-Routing UAV Problem is PSPACE-Complete","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Hsi-Ming Ho, Joel Ouaknine","submitted_at":"2014-11-10T01:10:37Z","abstract_excerpt":"Consider a finite set of targets, with each target assigned a relative deadline, and each pair of targets assigned a fixed transit flight time. Given a flock of identical UAVs, can one ensure that every target is repeatedly visited by some UAV at intervals of duration at most the target's relative deadline? The Cyclic-Routing UAV Problem (CR-UAV) is the question of whether this task has a solution.\n  This problem can straightforwardly be solved in PSPACE by modelling it as a network of timed automata. The special case of there being a single UAV is claimed to be NP-complete in the literature. "},"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":"1411.2874","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-11-10T01:10:37Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"4bca31dc2b9a310e1e534348c5055fc7d60b03775b4417abbf7f6ad06b24ec35","abstract_canon_sha256":"b892429281e1684a0d570377b33af11bc5d97e25d37e23c909c5616dae314c74"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:54.950112Z","signature_b64":"myrVcaBAF5AfbzOn9EXWlWJjeGU9appY30Wu3mL7DGNc6LwtRFOWHS6G8/vY1NbDC5XpjQg/jJxKMiJWNRjnBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb794db8d512ba769d204a58e54197eefb2e232676c885a46305baf8f3e685f6","last_reissued_at":"2026-05-18T02:28:54.949743Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:54.949743Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Cyclic-Routing UAV Problem is PSPACE-Complete","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Hsi-Ming Ho, Joel Ouaknine","submitted_at":"2014-11-10T01:10:37Z","abstract_excerpt":"Consider a finite set of targets, with each target assigned a relative deadline, and each pair of targets assigned a fixed transit flight time. Given a flock of identical UAVs, can one ensure that every target is repeatedly visited by some UAV at intervals of duration at most the target's relative deadline? The Cyclic-Routing UAV Problem (CR-UAV) is the question of whether this task has a solution.\n  This problem can straightforwardly be solved in PSPACE by modelling it as a network of timed automata. The special case of there being a single UAV is claimed to be NP-complete in the literature. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.2874","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":"1411.2874","created_at":"2026-05-18T02:28:54.949798+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.2874v2","created_at":"2026-05-18T02:28:54.949798+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.2874","created_at":"2026-05-18T02:28:54.949798+00:00"},{"alias_kind":"pith_short_12","alias_value":"7N4U3OGVCK5H","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"7N4U3OGVCK5HNHJA","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"7N4U3OGV","created_at":"2026-05-18T12:28:19.803747+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/7N4U3OGVCK5HNHJAJJMOKQMX53","json":"https://pith.science/pith/7N4U3OGVCK5HNHJAJJMOKQMX53.json","graph_json":"https://pith.science/api/pith-number/7N4U3OGVCK5HNHJAJJMOKQMX53/graph.json","events_json":"https://pith.science/api/pith-number/7N4U3OGVCK5HNHJAJJMOKQMX53/events.json","paper":"https://pith.science/paper/7N4U3OGV"},"agent_actions":{"view_html":"https://pith.science/pith/7N4U3OGVCK5HNHJAJJMOKQMX53","download_json":"https://pith.science/pith/7N4U3OGVCK5HNHJAJJMOKQMX53.json","view_paper":"https://pith.science/paper/7N4U3OGV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.2874&json=true","fetch_graph":"https://pith.science/api/pith-number/7N4U3OGVCK5HNHJAJJMOKQMX53/graph.json","fetch_events":"https://pith.science/api/pith-number/7N4U3OGVCK5HNHJAJJMOKQMX53/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7N4U3OGVCK5HNHJAJJMOKQMX53/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7N4U3OGVCK5HNHJAJJMOKQMX53/action/storage_attestation","attest_author":"https://pith.science/pith/7N4U3OGVCK5HNHJAJJMOKQMX53/action/author_attestation","sign_citation":"https://pith.science/pith/7N4U3OGVCK5HNHJAJJMOKQMX53/action/citation_signature","submit_replication":"https://pith.science/pith/7N4U3OGVCK5HNHJAJJMOKQMX53/action/replication_record"}},"created_at":"2026-05-18T02:28:54.949798+00:00","updated_at":"2026-05-18T02:28:54.949798+00:00"}