{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:7N4U3OGVCK5HNHJAJJMOKQMX53","short_pith_number":"pith:7N4U3OGV","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"},"canonical_sha256":"fb794db8d512ba769d204a58e54197eefb2e232676c885a46305baf8f3e685f6","source":{"kind":"arxiv","id":"1411.2874","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.2874","created_at":"2026-05-18T02:28:54Z"},{"alias_kind":"arxiv_version","alias_value":"1411.2874v2","created_at":"2026-05-18T02:28:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.2874","created_at":"2026-05-18T02:28:54Z"},{"alias_kind":"pith_short_12","alias_value":"7N4U3OGVCK5H","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"7N4U3OGVCK5HNHJA","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"7N4U3OGV","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:7N4U3OGVCK5HNHJAJJMOKQMX53","target":"record","payload":{"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"},"canonical_sha256":"fb794db8d512ba769d204a58e54197eefb2e232676c885a46305baf8f3e685f6","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"},"source_kind":"arxiv","source_id":"1411.2874","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-18T02:28:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qwlTjvS+uH1UpMGCUmgI+SvLH1bV7V5m2/GcLOzGAepRG/8FQayZcIb0iXvbpYRC1SAxkovytM7v8BFFKfzyCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T09:10:58.118252Z"},"content_sha256":"3428e5c3ee7956859f03cc15094bdcd5569a5aa1e7cfbf4c6387bca06dc5c829","schema_version":"1.0","event_id":"sha256:3428e5c3ee7956859f03cc15094bdcd5569a5aa1e7cfbf4c6387bca06dc5c829"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:7N4U3OGVCK5HNHJAJJMOKQMX53","target":"graph","payload":{"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"},"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-18T02:28:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TVL84MeqzHzsXPZ8AF3OZ1s2X3D494gH32MdjPUYN80KFjutsQ/5xdNeT/k4SmE0YgUIpynHoYGNVUh6IZJYCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T09:10:58.118637Z"},"content_sha256":"f8bc0e8184360a466da2fd4784116c8f821e4c119c1415b925da7adb5ea51fda","schema_version":"1.0","event_id":"sha256:f8bc0e8184360a466da2fd4784116c8f821e4c119c1415b925da7adb5ea51fda"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7N4U3OGVCK5HNHJAJJMOKQMX53/bundle.json","state_url":"https://pith.science/pith/7N4U3OGVCK5HNHJAJJMOKQMX53/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7N4U3OGVCK5HNHJAJJMOKQMX53/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-23T09:10:58Z","links":{"resolver":"https://pith.science/pith/7N4U3OGVCK5HNHJAJJMOKQMX53","bundle":"https://pith.science/pith/7N4U3OGVCK5HNHJAJJMOKQMX53/bundle.json","state":"https://pith.science/pith/7N4U3OGVCK5HNHJAJJMOKQMX53/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7N4U3OGVCK5HNHJAJJMOKQMX53/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:7N4U3OGVCK5HNHJAJJMOKQMX53","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":"b892429281e1684a0d570377b33af11bc5d97e25d37e23c909c5616dae314c74","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-11-10T01:10:37Z","title_canon_sha256":"4bca31dc2b9a310e1e534348c5055fc7d60b03775b4417abbf7f6ad06b24ec35"},"schema_version":"1.0","source":{"id":"1411.2874","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.2874","created_at":"2026-05-18T02:28:54Z"},{"alias_kind":"arxiv_version","alias_value":"1411.2874v2","created_at":"2026-05-18T02:28:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.2874","created_at":"2026-05-18T02:28:54Z"},{"alias_kind":"pith_short_12","alias_value":"7N4U3OGVCK5H","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"7N4U3OGVCK5HNHJA","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"7N4U3OGV","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:f8bc0e8184360a466da2fd4784116c8f821e4c119c1415b925da7adb5ea51fda","target":"graph","created_at":"2026-05-18T02:28:54Z","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":"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. ","authors_text":"Hsi-Ming Ho, Joel Ouaknine","cross_cats":["cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-11-10T01:10:37Z","title":"The Cyclic-Routing UAV Problem is PSPACE-Complete"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.2874","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:3428e5c3ee7956859f03cc15094bdcd5569a5aa1e7cfbf4c6387bca06dc5c829","target":"record","created_at":"2026-05-18T02:28:54Z","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":"b892429281e1684a0d570377b33af11bc5d97e25d37e23c909c5616dae314c74","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-11-10T01:10:37Z","title_canon_sha256":"4bca31dc2b9a310e1e534348c5055fc7d60b03775b4417abbf7f6ad06b24ec35"},"schema_version":"1.0","source":{"id":"1411.2874","kind":"arxiv","version":2}},"canonical_sha256":"fb794db8d512ba769d204a58e54197eefb2e232676c885a46305baf8f3e685f6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fb794db8d512ba769d204a58e54197eefb2e232676c885a46305baf8f3e685f6","first_computed_at":"2026-05-18T02:28:54.949743Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:28:54.949743Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"myrVcaBAF5AfbzOn9EXWlWJjeGU9appY30Wu3mL7DGNc6LwtRFOWHS6G8/vY1NbDC5XpjQg/jJxKMiJWNRjnBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:28:54.950112Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.2874","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3428e5c3ee7956859f03cc15094bdcd5569a5aa1e7cfbf4c6387bca06dc5c829","sha256:f8bc0e8184360a466da2fd4784116c8f821e4c119c1415b925da7adb5ea51fda"],"state_sha256":"d2d800bc4daf03cfd1db42eae4edecbfe6f34b5aa367005e0ecfce554cc6e30b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jJ3mBw7BHVxanT+4wzzex/7RLNtCymbO67eq0Z9WPh4sfwZLD4C+/i2aSQnSJ0O2oWzfwDZlpY6Pj+MgA27yDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T09:10:58.120667Z","bundle_sha256":"bda0e752ae064c1c6ff180f3cd38ef429fad31fc78cd5c50da0075e9e9bb6096"}}