{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:NL56QVS3KZP3QLZD3CHIXI3WLB","short_pith_number":"pith:NL56QVS3","canonical_record":{"source":{"id":"1808.02985","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-08-09T01:08:09Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"88473282a376d241472fe71a5bf786795c071c10cc9ed41008fc239e8c366590","abstract_canon_sha256":"6967157c5ffa5f55d679a91ef86cec6c2cc7c659f2177c4742fbae78a16394ac"},"schema_version":"1.0"},"canonical_sha256":"6afbe8565b565fb82f23d88e8ba37658571ea8e05cb604ce87f09ec073e74c7c","source":{"kind":"arxiv","id":"1808.02985","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.02985","created_at":"2026-05-18T00:08:30Z"},{"alias_kind":"arxiv_version","alias_value":"1808.02985v1","created_at":"2026-05-18T00:08:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.02985","created_at":"2026-05-18T00:08:30Z"},{"alias_kind":"pith_short_12","alias_value":"NL56QVS3KZP3","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NL56QVS3KZP3QLZD","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NL56QVS3","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:NL56QVS3KZP3QLZD3CHIXI3WLB","target":"record","payload":{"canonical_record":{"source":{"id":"1808.02985","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-08-09T01:08:09Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"88473282a376d241472fe71a5bf786795c071c10cc9ed41008fc239e8c366590","abstract_canon_sha256":"6967157c5ffa5f55d679a91ef86cec6c2cc7c659f2177c4742fbae78a16394ac"},"schema_version":"1.0"},"canonical_sha256":"6afbe8565b565fb82f23d88e8ba37658571ea8e05cb604ce87f09ec073e74c7c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:30.517485Z","signature_b64":"ovRCnOq6VXCmr47SHfl0fwkdBqxAI/Na8aJiglUs3QiqrJSyTKjI8GwidLYDMK4Brr0QS+wU7DFd4FifM7olCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6afbe8565b565fb82f23d88e8ba37658571ea8e05cb604ce87f09ec073e74c7c","last_reissued_at":"2026-05-18T00:08:30.516933Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:30.516933Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.02985","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-18T00:08:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+HJu8KU7CH9oz1AMPqvp/6lZ5oDVtrpfbWQagvSr6YX3XDBLVyZ2h2BAlWLN37pQz66+WgRXMETV9dAbaQhHBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:52:55.646480Z"},"content_sha256":"e20ce7a9c27106df1861960aff66ca657882c5158694aa3b29bf0c578f1fcc87","schema_version":"1.0","event_id":"sha256:e20ce7a9c27106df1861960aff66ca657882c5158694aa3b29bf0c578f1fcc87"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:NL56QVS3KZP3QLZD3CHIXI3WLB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sampling-Based Tour Generation of Arbitrarily Oriented Dubins Sensor Platforms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.RO","authors_text":"Dae-Sung Jang, Doo-Hyun Cho, Han-Lim Choi","submitted_at":"2018-08-09T01:08:09Z","abstract_excerpt":"This paper describes a formulation and develops a novel procedure for a fleet of unmanned aerial vehicles (UAVs) from the perspective of remotely executable tasks. In a complex mission environment, the characteristics of vehicles can be different in terms of sensing capability, range, direction, or the motion constraints. The purpose of this paper is to find a set of paths that minimizes the sum of costs while every task region is visited exactly once under certain reasonable assumptions. The heterogeneous multi-UAV path planning problem is formulated as a generalized, heterogeneous, multiple "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.02985","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-18T00:08:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"369514n2ce8ZnFlP4FmJA+bM8PQUe0wWNhdukGNGz+Ud35cL9pY/eQwV+MaLLZdjiVuKhgJQfCQ/rI+DXtFXBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:52:55.647243Z"},"content_sha256":"04ed50b804f4f88690152be428b0a5b5e124c8b41583439858b43e40003cf7b6","schema_version":"1.0","event_id":"sha256:04ed50b804f4f88690152be428b0a5b5e124c8b41583439858b43e40003cf7b6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NL56QVS3KZP3QLZD3CHIXI3WLB/bundle.json","state_url":"https://pith.science/pith/NL56QVS3KZP3QLZD3CHIXI3WLB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NL56QVS3KZP3QLZD3CHIXI3WLB/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-11T22:52:55Z","links":{"resolver":"https://pith.science/pith/NL56QVS3KZP3QLZD3CHIXI3WLB","bundle":"https://pith.science/pith/NL56QVS3KZP3QLZD3CHIXI3WLB/bundle.json","state":"https://pith.science/pith/NL56QVS3KZP3QLZD3CHIXI3WLB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NL56QVS3KZP3QLZD3CHIXI3WLB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NL56QVS3KZP3QLZD3CHIXI3WLB","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":"6967157c5ffa5f55d679a91ef86cec6c2cc7c659f2177c4742fbae78a16394ac","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-08-09T01:08:09Z","title_canon_sha256":"88473282a376d241472fe71a5bf786795c071c10cc9ed41008fc239e8c366590"},"schema_version":"1.0","source":{"id":"1808.02985","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.02985","created_at":"2026-05-18T00:08:30Z"},{"alias_kind":"arxiv_version","alias_value":"1808.02985v1","created_at":"2026-05-18T00:08:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.02985","created_at":"2026-05-18T00:08:30Z"},{"alias_kind":"pith_short_12","alias_value":"NL56QVS3KZP3","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NL56QVS3KZP3QLZD","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NL56QVS3","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:04ed50b804f4f88690152be428b0a5b5e124c8b41583439858b43e40003cf7b6","target":"graph","created_at":"2026-05-18T00:08:30Z","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":"This paper describes a formulation and develops a novel procedure for a fleet of unmanned aerial vehicles (UAVs) from the perspective of remotely executable tasks. In a complex mission environment, the characteristics of vehicles can be different in terms of sensing capability, range, direction, or the motion constraints. The purpose of this paper is to find a set of paths that minimizes the sum of costs while every task region is visited exactly once under certain reasonable assumptions. The heterogeneous multi-UAV path planning problem is formulated as a generalized, heterogeneous, multiple ","authors_text":"Dae-Sung Jang, Doo-Hyun Cho, Han-Lim Choi","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-08-09T01:08:09Z","title":"Sampling-Based Tour Generation of Arbitrarily Oriented Dubins Sensor Platforms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.02985","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:e20ce7a9c27106df1861960aff66ca657882c5158694aa3b29bf0c578f1fcc87","target":"record","created_at":"2026-05-18T00:08:30Z","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":"6967157c5ffa5f55d679a91ef86cec6c2cc7c659f2177c4742fbae78a16394ac","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-08-09T01:08:09Z","title_canon_sha256":"88473282a376d241472fe71a5bf786795c071c10cc9ed41008fc239e8c366590"},"schema_version":"1.0","source":{"id":"1808.02985","kind":"arxiv","version":1}},"canonical_sha256":"6afbe8565b565fb82f23d88e8ba37658571ea8e05cb604ce87f09ec073e74c7c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6afbe8565b565fb82f23d88e8ba37658571ea8e05cb604ce87f09ec073e74c7c","first_computed_at":"2026-05-18T00:08:30.516933Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:30.516933Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ovRCnOq6VXCmr47SHfl0fwkdBqxAI/Na8aJiglUs3QiqrJSyTKjI8GwidLYDMK4Brr0QS+wU7DFd4FifM7olCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:30.517485Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.02985","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e20ce7a9c27106df1861960aff66ca657882c5158694aa3b29bf0c578f1fcc87","sha256:04ed50b804f4f88690152be428b0a5b5e124c8b41583439858b43e40003cf7b6"],"state_sha256":"b400b2711d6f067b6682eefe74a18ca5c5d3f1d89f82b97a5cc21b57106435da"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"26Rx0l+Lqf8mD5VPW0o1XgRHkQzBEUoIO67EHfhZXJAMfjpkkYrEVLujQve8NOts4EjoXfUCDSuh9Kfz4qJTBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T22:52:55.651872Z","bundle_sha256":"a21806d1ed4a986d54031e6d41d059d7c2c5c6fda69f3c08cba13b773f62c7d2"}}