{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:WBVHGK3NIBJJJERNSIZELLMRVM","short_pith_number":"pith:WBVHGK3N","canonical_record":{"source":{"id":"1604.05064","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-04-18T10:07:25Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"d372de2e9a2e8abe4f0a3f0c179265d18a2e3d7e50b4bbefb307e6d4dbd3dc0c","abstract_canon_sha256":"f62d78f5a332971a4981ff26904ec3d3952ca2b348bd9186e611f649862f6e81"},"schema_version":"1.0"},"canonical_sha256":"b06a732b6d405294922d923245ad91ab3e308dbe8ed05127e291d4e33e777fbf","source":{"kind":"arxiv","id":"1604.05064","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.05064","created_at":"2026-05-18T01:16:55Z"},{"alias_kind":"arxiv_version","alias_value":"1604.05064v1","created_at":"2026-05-18T01:16:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.05064","created_at":"2026-05-18T01:16:55Z"},{"alias_kind":"pith_short_12","alias_value":"WBVHGK3NIBJJ","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"WBVHGK3NIBJJJERN","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"WBVHGK3N","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:WBVHGK3NIBJJJERNSIZELLMRVM","target":"record","payload":{"canonical_record":{"source":{"id":"1604.05064","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-04-18T10:07:25Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"d372de2e9a2e8abe4f0a3f0c179265d18a2e3d7e50b4bbefb307e6d4dbd3dc0c","abstract_canon_sha256":"f62d78f5a332971a4981ff26904ec3d3952ca2b348bd9186e611f649862f6e81"},"schema_version":"1.0"},"canonical_sha256":"b06a732b6d405294922d923245ad91ab3e308dbe8ed05127e291d4e33e777fbf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:55.846884Z","signature_b64":"9D/TMXL0kGC0hWNna8IlWDyDazdQyYafqc9uru4ef9kWtOfHZFV+zJ57DnCtCvB1SOjVlQIrNVbFWOhrk7JTAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b06a732b6d405294922d923245ad91ab3e308dbe8ed05127e291d4e33e777fbf","last_reissued_at":"2026-05-18T01:16:55.846180Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:55.846180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.05064","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-18T01:16:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zlze+SFgNpjnOife8nSUEomDy/g+z9iZnjMFnx0pVkaO1CaXPIQTww1Kw5YajElWbUZ6sGwSbhmN/wetsL/JBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T03:55:18.095946Z"},"content_sha256":"21c31edb8ea0d071314035c97ddb5a8615bbf9df63e53ccea2e6672cc529e71a","schema_version":"1.0","event_id":"sha256:21c31edb8ea0d071314035c97ddb5a8615bbf9df63e53ccea2e6672cc529e71a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:WBVHGK3NIBJJJERNSIZELLMRVM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Approximation Algorithm for a Shortest Dubins Path Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"cs.RO","authors_text":"Pramod Khargonekar, Sivakumar Rathinam","submitted_at":"2016-04-18T10:07:25Z","abstract_excerpt":"The problem of finding the shortest path for a vehicle visiting a given sequence of target points subject to the motion constraints of the vehicle is an important problem that arises in several monitoring and surveillance applications involving unmanned aerial vehicles. There is currently no algorithm that can find an optimal solution to this problem. Therefore, heuristics that can find approximate solutions with guarantees on the quality of the solutions are useful. The best approximation algorithm currently available for the case when the distance between any two adjacent target points in th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.05064","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-18T01:16:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kZayxJfMutymvHgbnxkh4ZB0Q8d74RLsY2WlJ9EnxMh9Cc08dtYP1XwHCxX+/E8Xi+etpZLpSzwymMWIH8OgBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T03:55:18.096484Z"},"content_sha256":"e21fc0f0585aab228dc1633916bc0ae7aafb7aa307f2a8d406d91f2ee7a8683c","schema_version":"1.0","event_id":"sha256:e21fc0f0585aab228dc1633916bc0ae7aafb7aa307f2a8d406d91f2ee7a8683c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WBVHGK3NIBJJJERNSIZELLMRVM/bundle.json","state_url":"https://pith.science/pith/WBVHGK3NIBJJJERNSIZELLMRVM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WBVHGK3NIBJJJERNSIZELLMRVM/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:55:18Z","links":{"resolver":"https://pith.science/pith/WBVHGK3NIBJJJERNSIZELLMRVM","bundle":"https://pith.science/pith/WBVHGK3NIBJJJERNSIZELLMRVM/bundle.json","state":"https://pith.science/pith/WBVHGK3NIBJJJERNSIZELLMRVM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WBVHGK3NIBJJJERNSIZELLMRVM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:WBVHGK3NIBJJJERNSIZELLMRVM","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":"f62d78f5a332971a4981ff26904ec3d3952ca2b348bd9186e611f649862f6e81","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-04-18T10:07:25Z","title_canon_sha256":"d372de2e9a2e8abe4f0a3f0c179265d18a2e3d7e50b4bbefb307e6d4dbd3dc0c"},"schema_version":"1.0","source":{"id":"1604.05064","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.05064","created_at":"2026-05-18T01:16:55Z"},{"alias_kind":"arxiv_version","alias_value":"1604.05064v1","created_at":"2026-05-18T01:16:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.05064","created_at":"2026-05-18T01:16:55Z"},{"alias_kind":"pith_short_12","alias_value":"WBVHGK3NIBJJ","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"WBVHGK3NIBJJJERN","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"WBVHGK3N","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:e21fc0f0585aab228dc1633916bc0ae7aafb7aa307f2a8d406d91f2ee7a8683c","target":"graph","created_at":"2026-05-18T01:16:55Z","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":"The problem of finding the shortest path for a vehicle visiting a given sequence of target points subject to the motion constraints of the vehicle is an important problem that arises in several monitoring and surveillance applications involving unmanned aerial vehicles. There is currently no algorithm that can find an optimal solution to this problem. Therefore, heuristics that can find approximate solutions with guarantees on the quality of the solutions are useful. The best approximation algorithm currently available for the case when the distance between any two adjacent target points in th","authors_text":"Pramod Khargonekar, Sivakumar Rathinam","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-04-18T10:07:25Z","title":"An Approximation Algorithm for a Shortest Dubins Path Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.05064","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:21c31edb8ea0d071314035c97ddb5a8615bbf9df63e53ccea2e6672cc529e71a","target":"record","created_at":"2026-05-18T01:16:55Z","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":"f62d78f5a332971a4981ff26904ec3d3952ca2b348bd9186e611f649862f6e81","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-04-18T10:07:25Z","title_canon_sha256":"d372de2e9a2e8abe4f0a3f0c179265d18a2e3d7e50b4bbefb307e6d4dbd3dc0c"},"schema_version":"1.0","source":{"id":"1604.05064","kind":"arxiv","version":1}},"canonical_sha256":"b06a732b6d405294922d923245ad91ab3e308dbe8ed05127e291d4e33e777fbf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b06a732b6d405294922d923245ad91ab3e308dbe8ed05127e291d4e33e777fbf","first_computed_at":"2026-05-18T01:16:55.846180Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:55.846180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9D/TMXL0kGC0hWNna8IlWDyDazdQyYafqc9uru4ef9kWtOfHZFV+zJ57DnCtCvB1SOjVlQIrNVbFWOhrk7JTAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:55.846884Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.05064","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:21c31edb8ea0d071314035c97ddb5a8615bbf9df63e53ccea2e6672cc529e71a","sha256:e21fc0f0585aab228dc1633916bc0ae7aafb7aa307f2a8d406d91f2ee7a8683c"],"state_sha256":"efa6e6435b5c4254a8249cda32f29437fc1916a0371c003364d4fdea51fcac6d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4vg/gxd1/clLzO0JTgkr4fjetUiSyXx5/p09zREnRdb6uhl1RkgRkAyMh/DHkIpk1mAqEqnnQ7nblqeqrg8MBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T03:55:18.098996Z","bundle_sha256":"5232b8d8849657abd6c5145341322fe1a126fd76a40db350a76bcf4eafdf4cc4"}}