{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:NSC2J54KOBJJFCXAI2WVFB657K","short_pith_number":"pith:NSC2J54K","canonical_record":{"source":{"id":"2402.10529","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-02-16T09:31:51Z","cross_cats_sorted":[],"title_canon_sha256":"9de9ecc549b2bd6904ba9941b6c28601c3b3930fa834a3b476cb16b48b608de5","abstract_canon_sha256":"c23436780c2ac4e028dbcd76a78c37a30168b39fccf19168085be9c8be076be1"},"schema_version":"1.0"},"canonical_sha256":"6c85a4f78a7052928ae046ad5287ddfaa9caaa48778db5441cc15bbadbf45128","source":{"kind":"arxiv","id":"2402.10529","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.10529","created_at":"2026-07-05T07:45:57Z"},{"alias_kind":"arxiv_version","alias_value":"2402.10529v1","created_at":"2026-07-05T07:45:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.10529","created_at":"2026-07-05T07:45:57Z"},{"alias_kind":"pith_short_12","alias_value":"NSC2J54KOBJJ","created_at":"2026-07-05T07:45:57Z"},{"alias_kind":"pith_short_16","alias_value":"NSC2J54KOBJJFCXA","created_at":"2026-07-05T07:45:57Z"},{"alias_kind":"pith_short_8","alias_value":"NSC2J54K","created_at":"2026-07-05T07:45:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:NSC2J54KOBJJFCXAI2WVFB657K","target":"record","payload":{"canonical_record":{"source":{"id":"2402.10529","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-02-16T09:31:51Z","cross_cats_sorted":[],"title_canon_sha256":"9de9ecc549b2bd6904ba9941b6c28601c3b3930fa834a3b476cb16b48b608de5","abstract_canon_sha256":"c23436780c2ac4e028dbcd76a78c37a30168b39fccf19168085be9c8be076be1"},"schema_version":"1.0"},"canonical_sha256":"6c85a4f78a7052928ae046ad5287ddfaa9caaa48778db5441cc15bbadbf45128","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:45:57.568070Z","signature_b64":"k4YQ4L3uzr5K5nfcXYy/QPyPD3/P2WcZ16SjC4KOXDi/6yD9UMV3r8gJHcfT9gyyhOH/ThPydUDK79GYj30aBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c85a4f78a7052928ae046ad5287ddfaa9caaa48778db5441cc15bbadbf45128","last_reissued_at":"2026-07-05T07:45:57.567661Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:45:57.567661Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2402.10529","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-07-05T07:45:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H0V7v+WwZJ03NHR+Jt1QGJmRwUHk/upqtu/bTSgCZqHwZNShp56WvD1lDHDS9bd2w7ieyZauY0UnWx49tXxfCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-11T08:05:24.937882Z"},"content_sha256":"94a3d6e31aa9b682b6b7a3d6338990dc05b9c31e88660cfdbb46af24b05db4b1","schema_version":"1.0","event_id":"sha256:94a3d6e31aa9b682b6b7a3d6338990dc05b9c31e88660cfdbb46af24b05db4b1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:NSC2J54KOBJJFCXAI2WVFB657K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Energy-aware Multi-UAV Coverage Mission Planning with Optimal Speed of Flight","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Denys Datsko, Frantisek Nekovar, Martin Saska, Robert Penicka","submitted_at":"2024-02-16T09:31:51Z","abstract_excerpt":"This paper tackles the problem of planning minimum-energy coverage paths for multiple UAVs. The addressed Multi-UAV Coverage Path Planning (mCPP) is a crucial problem for many UAV applications such as inspection and aerial survey. However, the typical path-length objective of existing approaches does not directly minimize the energy consumption, nor allows for constraining energy of individual paths by the battery capacity. To this end, we propose a novel mCPP method that uses the optimal flight speed for minimizing energy consumption per traveled distance and a simple yet precise energy consu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.10529","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2402.10529/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T07:45:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U0oZyN/pjZzGfaQFMKTyt/TjECsBIg06wR8AJgV9gLK2L576untxQ+jOYE7OUsgDIyYitcGsxb2XZNtBcXGJAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-11T08:05:24.938256Z"},"content_sha256":"05b476026cfc2d3e3dbc60d410b161430deb815f4eff97f685602ab21a5ef0ea","schema_version":"1.0","event_id":"sha256:05b476026cfc2d3e3dbc60d410b161430deb815f4eff97f685602ab21a5ef0ea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NSC2J54KOBJJFCXAI2WVFB657K/bundle.json","state_url":"https://pith.science/pith/NSC2J54KOBJJFCXAI2WVFB657K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NSC2J54KOBJJFCXAI2WVFB657K/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-07-11T08:05:24Z","links":{"resolver":"https://pith.science/pith/NSC2J54KOBJJFCXAI2WVFB657K","bundle":"https://pith.science/pith/NSC2J54KOBJJFCXAI2WVFB657K/bundle.json","state":"https://pith.science/pith/NSC2J54KOBJJFCXAI2WVFB657K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NSC2J54KOBJJFCXAI2WVFB657K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:NSC2J54KOBJJFCXAI2WVFB657K","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":"c23436780c2ac4e028dbcd76a78c37a30168b39fccf19168085be9c8be076be1","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-02-16T09:31:51Z","title_canon_sha256":"9de9ecc549b2bd6904ba9941b6c28601c3b3930fa834a3b476cb16b48b608de5"},"schema_version":"1.0","source":{"id":"2402.10529","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.10529","created_at":"2026-07-05T07:45:57Z"},{"alias_kind":"arxiv_version","alias_value":"2402.10529v1","created_at":"2026-07-05T07:45:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.10529","created_at":"2026-07-05T07:45:57Z"},{"alias_kind":"pith_short_12","alias_value":"NSC2J54KOBJJ","created_at":"2026-07-05T07:45:57Z"},{"alias_kind":"pith_short_16","alias_value":"NSC2J54KOBJJFCXA","created_at":"2026-07-05T07:45:57Z"},{"alias_kind":"pith_short_8","alias_value":"NSC2J54K","created_at":"2026-07-05T07:45:57Z"}],"graph_snapshots":[{"event_id":"sha256:05b476026cfc2d3e3dbc60d410b161430deb815f4eff97f685602ab21a5ef0ea","target":"graph","created_at":"2026-07-05T07:45:57Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2402.10529/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper tackles the problem of planning minimum-energy coverage paths for multiple UAVs. The addressed Multi-UAV Coverage Path Planning (mCPP) is a crucial problem for many UAV applications such as inspection and aerial survey. However, the typical path-length objective of existing approaches does not directly minimize the energy consumption, nor allows for constraining energy of individual paths by the battery capacity. To this end, we propose a novel mCPP method that uses the optimal flight speed for minimizing energy consumption per traveled distance and a simple yet precise energy consu","authors_text":"Denys Datsko, Frantisek Nekovar, Martin Saska, Robert Penicka","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-02-16T09:31:51Z","title":"Energy-aware Multi-UAV Coverage Mission Planning with Optimal Speed of Flight"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.10529","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:94a3d6e31aa9b682b6b7a3d6338990dc05b9c31e88660cfdbb46af24b05db4b1","target":"record","created_at":"2026-07-05T07:45:57Z","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":"c23436780c2ac4e028dbcd76a78c37a30168b39fccf19168085be9c8be076be1","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-02-16T09:31:51Z","title_canon_sha256":"9de9ecc549b2bd6904ba9941b6c28601c3b3930fa834a3b476cb16b48b608de5"},"schema_version":"1.0","source":{"id":"2402.10529","kind":"arxiv","version":1}},"canonical_sha256":"6c85a4f78a7052928ae046ad5287ddfaa9caaa48778db5441cc15bbadbf45128","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c85a4f78a7052928ae046ad5287ddfaa9caaa48778db5441cc15bbadbf45128","first_computed_at":"2026-07-05T07:45:57.567661Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:45:57.567661Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"k4YQ4L3uzr5K5nfcXYy/QPyPD3/P2WcZ16SjC4KOXDi/6yD9UMV3r8gJHcfT9gyyhOH/ThPydUDK79GYj30aBw==","signature_status":"signed_v1","signed_at":"2026-07-05T07:45:57.568070Z","signed_message":"canonical_sha256_bytes"},"source_id":"2402.10529","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:94a3d6e31aa9b682b6b7a3d6338990dc05b9c31e88660cfdbb46af24b05db4b1","sha256:05b476026cfc2d3e3dbc60d410b161430deb815f4eff97f685602ab21a5ef0ea"],"state_sha256":"e64ac2dbf3cbb8c6dc4923351997d92c24cc2031003f12fac53d8582d594c7af"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/FY3HjTCA2SDb5BcpIv5d6tfN0pRmsoem9axptbD8KUJ6dPj7y/Tosd+6YBzQYLZlpxspupKkBd6TTCws2GrAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-11T08:05:24.940697Z","bundle_sha256":"8fd5146df01326b759dc813b1833eddf0dd6aed3f7af175af92b88fa834645cb"}}