{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:JU5CI5AX6GP7IQQLGZXVMDMVJA","short_pith_number":"pith:JU5CI5AX","canonical_record":{"source":{"id":"1304.0494","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-01T23:04:27Z","cross_cats_sorted":[],"title_canon_sha256":"e02dfbbdd2c8c1983fa1344e1a69b5fa9a68db9f18e9da7b8e4b7565f85c29a9","abstract_canon_sha256":"c083c81fb6533d279252e244f25540c8a215805d70a27ad7c591c6623136db9e"},"schema_version":"1.0"},"canonical_sha256":"4d3a247417f19ff4420b366f560d95481834aa207686e281761d9df55c150de6","source":{"kind":"arxiv","id":"1304.0494","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.0494","created_at":"2026-05-18T03:29:15Z"},{"alias_kind":"arxiv_version","alias_value":"1304.0494v1","created_at":"2026-05-18T03:29:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.0494","created_at":"2026-05-18T03:29:15Z"},{"alias_kind":"pith_short_12","alias_value":"JU5CI5AX6GP7","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JU5CI5AX6GP7IQQL","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JU5CI5AX","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:JU5CI5AX6GP7IQQLGZXVMDMVJA","target":"record","payload":{"canonical_record":{"source":{"id":"1304.0494","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-01T23:04:27Z","cross_cats_sorted":[],"title_canon_sha256":"e02dfbbdd2c8c1983fa1344e1a69b5fa9a68db9f18e9da7b8e4b7565f85c29a9","abstract_canon_sha256":"c083c81fb6533d279252e244f25540c8a215805d70a27ad7c591c6623136db9e"},"schema_version":"1.0"},"canonical_sha256":"4d3a247417f19ff4420b366f560d95481834aa207686e281761d9df55c150de6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:15.226457Z","signature_b64":"nX4236uoKoZWEVMbK8oNXqFFtHlTkK84fGqfjv1D+Pc1a1MxCABo6Eab547bLeK8psJgmE6lskqCoqOXLYCoCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d3a247417f19ff4420b366f560d95481834aa207686e281761d9df55c150de6","last_reissued_at":"2026-05-18T03:29:15.225427Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:15.225427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.0494","source_version":1,"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:29:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FPte8W7QrKwqAkpzG9uWzbojHA9A+E2ef02sJQ+qNMJYdmrj9t0/h7eP1sCdYNAMlhdvoIQ8QnwDl0bSxuZtAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T03:09:03.799652Z"},"content_sha256":"bfe7a55126b06e4d3287879fcb4e7916438682214a79bead170f7d32b6b4ffd6","schema_version":"1.0","event_id":"sha256:bfe7a55126b06e4d3287879fcb4e7916438682214a79bead170f7d32b6b4ffd6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:JU5CI5AX6GP7IQQLGZXVMDMVJA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithms for Routing an Unmanned Aerial Vehicle in the presence of Refueling Depots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Kaarthik Sundar, Sivakumar Rathinam","submitted_at":"2013-04-01T23:04:27Z","abstract_excerpt":"We consider a single Unmanned Aerial Vehicle (UAV) routing problem where there are multiple depots and the vehicle is allowed to refuel at any depot. The objective of the problem is to find a path for the UAV such that each target is visited at least once by the vehicle, the fuel constraint is never violated along the path for the UAV, and the total fuel required by the UAV is a minimum. We develop an approximation algorithm for the problem, and propose fast construction and improvement heuristics to solve the same. Computational results show that solutions whose costs are on an average within"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.0494","kind":"arxiv","version":1},"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:29:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oxAs4iDQAdE31DFMS+1evKSLNikluWEyTxWf6nlYdMUe/68TJQ4v34XLaeW65z/mN/ZNQCa4SGw49tD4Sr/TCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T03:09:03.800201Z"},"content_sha256":"e326c681a9f844611bb6752d74d4c07f3b93e640dd1cd19a137990e2893c4da4","schema_version":"1.0","event_id":"sha256:e326c681a9f844611bb6752d74d4c07f3b93e640dd1cd19a137990e2893c4da4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JU5CI5AX6GP7IQQLGZXVMDMVJA/bundle.json","state_url":"https://pith.science/pith/JU5CI5AX6GP7IQQLGZXVMDMVJA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JU5CI5AX6GP7IQQLGZXVMDMVJA/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-02T03:09:03Z","links":{"resolver":"https://pith.science/pith/JU5CI5AX6GP7IQQLGZXVMDMVJA","bundle":"https://pith.science/pith/JU5CI5AX6GP7IQQLGZXVMDMVJA/bundle.json","state":"https://pith.science/pith/JU5CI5AX6GP7IQQLGZXVMDMVJA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JU5CI5AX6GP7IQQLGZXVMDMVJA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:JU5CI5AX6GP7IQQLGZXVMDMVJA","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":"c083c81fb6533d279252e244f25540c8a215805d70a27ad7c591c6623136db9e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-01T23:04:27Z","title_canon_sha256":"e02dfbbdd2c8c1983fa1344e1a69b5fa9a68db9f18e9da7b8e4b7565f85c29a9"},"schema_version":"1.0","source":{"id":"1304.0494","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.0494","created_at":"2026-05-18T03:29:15Z"},{"alias_kind":"arxiv_version","alias_value":"1304.0494v1","created_at":"2026-05-18T03:29:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.0494","created_at":"2026-05-18T03:29:15Z"},{"alias_kind":"pith_short_12","alias_value":"JU5CI5AX6GP7","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JU5CI5AX6GP7IQQL","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JU5CI5AX","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:e326c681a9f844611bb6752d74d4c07f3b93e640dd1cd19a137990e2893c4da4","target":"graph","created_at":"2026-05-18T03:29:15Z","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":"We consider a single Unmanned Aerial Vehicle (UAV) routing problem where there are multiple depots and the vehicle is allowed to refuel at any depot. The objective of the problem is to find a path for the UAV such that each target is visited at least once by the vehicle, the fuel constraint is never violated along the path for the UAV, and the total fuel required by the UAV is a minimum. We develop an approximation algorithm for the problem, and propose fast construction and improvement heuristics to solve the same. Computational results show that solutions whose costs are on an average within","authors_text":"Kaarthik Sundar, Sivakumar Rathinam","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-01T23:04:27Z","title":"Algorithms for Routing an Unmanned Aerial Vehicle in the presence of Refueling Depots"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.0494","kind":"arxiv","version":1},"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:bfe7a55126b06e4d3287879fcb4e7916438682214a79bead170f7d32b6b4ffd6","target":"record","created_at":"2026-05-18T03:29:15Z","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":"c083c81fb6533d279252e244f25540c8a215805d70a27ad7c591c6623136db9e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-01T23:04:27Z","title_canon_sha256":"e02dfbbdd2c8c1983fa1344e1a69b5fa9a68db9f18e9da7b8e4b7565f85c29a9"},"schema_version":"1.0","source":{"id":"1304.0494","kind":"arxiv","version":1}},"canonical_sha256":"4d3a247417f19ff4420b366f560d95481834aa207686e281761d9df55c150de6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4d3a247417f19ff4420b366f560d95481834aa207686e281761d9df55c150de6","first_computed_at":"2026-05-18T03:29:15.225427Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:29:15.225427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nX4236uoKoZWEVMbK8oNXqFFtHlTkK84fGqfjv1D+Pc1a1MxCABo6Eab547bLeK8psJgmE6lskqCoqOXLYCoCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:29:15.226457Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.0494","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bfe7a55126b06e4d3287879fcb4e7916438682214a79bead170f7d32b6b4ffd6","sha256:e326c681a9f844611bb6752d74d4c07f3b93e640dd1cd19a137990e2893c4da4"],"state_sha256":"07534ae25fd0b9077717af100452cedb7aa82eb943e0d9f9b7ac10398615f738"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ID9ygu399UXGV11q3GJkH4t7eooR0DzlrxBQ7cYliSiRS1QP2lMyTPkxpR/vraDzcLEnQ4P8QZZuq1xgCMFcBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T03:09:03.802858Z","bundle_sha256":"148f4f97d89f6f5083ff497ea09b81b57c9123cdd63fef31b95dce121aa734fd"}}