{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:6VZ3U6BQLTO6UPOVPPIIBCITQZ","short_pith_number":"pith:6VZ3U6BQ","canonical_record":{"source":{"id":"1902.10182","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-02-26T19:46:42Z","cross_cats_sorted":[],"title_canon_sha256":"012c3ee0eb4c8203278e12681b2a3c5d75d32701601e0ea74c103e9c7f5e3c0e","abstract_canon_sha256":"0a0da162c37fb221a8c1e09c1d034b29e657a4fda8c3dc2691e9238ca272d94c"},"schema_version":"1.0"},"canonical_sha256":"f573ba78305cddea3dd57bd0808913866f8031c135e0523964248c324cf6ac2c","source":{"kind":"arxiv","id":"1902.10182","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.10182","created_at":"2026-05-17T23:52:31Z"},{"alias_kind":"arxiv_version","alias_value":"1902.10182v1","created_at":"2026-05-17T23:52:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.10182","created_at":"2026-05-17T23:52:31Z"},{"alias_kind":"pith_short_12","alias_value":"6VZ3U6BQLTO6","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6VZ3U6BQLTO6UPOV","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6VZ3U6BQ","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:6VZ3U6BQLTO6UPOVPPIIBCITQZ","target":"record","payload":{"canonical_record":{"source":{"id":"1902.10182","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-02-26T19:46:42Z","cross_cats_sorted":[],"title_canon_sha256":"012c3ee0eb4c8203278e12681b2a3c5d75d32701601e0ea74c103e9c7f5e3c0e","abstract_canon_sha256":"0a0da162c37fb221a8c1e09c1d034b29e657a4fda8c3dc2691e9238ca272d94c"},"schema_version":"1.0"},"canonical_sha256":"f573ba78305cddea3dd57bd0808913866f8031c135e0523964248c324cf6ac2c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:31.548047Z","signature_b64":"VRoAnYv8CRAsG4NKIXj3pde3L2bxcm//bymynKahyCJIojzJeViQMfRB+Cz3A5IWUas4y4/ozRVRwlbIna1aBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f573ba78305cddea3dd57bd0808913866f8031c135e0523964248c324cf6ac2c","last_reissued_at":"2026-05-17T23:52:31.547511Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:31.547511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.10182","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-17T23:52:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sNnyOrYBflLEq9hSey8wntKpPdvracpXPpOCyrzvxD2YSqbm5zfd38pOYivaukZcNCFh5TSQiL3JBZGcbvmkAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:41:13.648189Z"},"content_sha256":"19042ed8365612422d181508fdc9dbad019ddf4d56f8a70be20391a71ae9c090","schema_version":"1.0","event_id":"sha256:19042ed8365612422d181508fdc9dbad019ddf4d56f8a70be20391a71ae9c090"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:6VZ3U6BQLTO6UPOVPPIIBCITQZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Obstacle-aware Adaptive Informative Path Planning for UAV-based Target Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Ajith Anil Meera, Alexander Millane, Marija Popovic, Roland Siegwart","submitted_at":"2019-02-26T19:46:42Z","abstract_excerpt":"Target search with unmanned aerial vehicles (UAVs) is relevant problem to many scenarios, e.g., search and rescue (SaR). However, a key challenge is planning paths for maximal search efficiency given flight time constraints. To address this, we propose the Obstacle-aware Adaptive Informative Path Planning (OA-IPP) algorithm for target search in cluttered environments using UAVs. Our approach leverages a layered planning strategy using a Gaussian Process (GP)-based model of target occupancy to generate informative paths in continuous 3D space. Within this framework, we introduce an adaptive rep"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.10182","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-17T23:52:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i+Q6DOfwsUseg8JRzhufGxlGOHO2xcMs+bIukB0jxA8wiKu89kggH82SKxxKX0FQF8srLaBWrEEMwHM9xo0bDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:41:13.648866Z"},"content_sha256":"4b7f849e52e0d2f241dd43e0a4115d102d982933911481384d2e453f669e0466","schema_version":"1.0","event_id":"sha256:4b7f849e52e0d2f241dd43e0a4115d102d982933911481384d2e453f669e0466"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6VZ3U6BQLTO6UPOVPPIIBCITQZ/bundle.json","state_url":"https://pith.science/pith/6VZ3U6BQLTO6UPOVPPIIBCITQZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6VZ3U6BQLTO6UPOVPPIIBCITQZ/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-05-31T00:41:13Z","links":{"resolver":"https://pith.science/pith/6VZ3U6BQLTO6UPOVPPIIBCITQZ","bundle":"https://pith.science/pith/6VZ3U6BQLTO6UPOVPPIIBCITQZ/bundle.json","state":"https://pith.science/pith/6VZ3U6BQLTO6UPOVPPIIBCITQZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6VZ3U6BQLTO6UPOVPPIIBCITQZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:6VZ3U6BQLTO6UPOVPPIIBCITQZ","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":"0a0da162c37fb221a8c1e09c1d034b29e657a4fda8c3dc2691e9238ca272d94c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-02-26T19:46:42Z","title_canon_sha256":"012c3ee0eb4c8203278e12681b2a3c5d75d32701601e0ea74c103e9c7f5e3c0e"},"schema_version":"1.0","source":{"id":"1902.10182","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.10182","created_at":"2026-05-17T23:52:31Z"},{"alias_kind":"arxiv_version","alias_value":"1902.10182v1","created_at":"2026-05-17T23:52:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.10182","created_at":"2026-05-17T23:52:31Z"},{"alias_kind":"pith_short_12","alias_value":"6VZ3U6BQLTO6","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6VZ3U6BQLTO6UPOV","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6VZ3U6BQ","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:4b7f849e52e0d2f241dd43e0a4115d102d982933911481384d2e453f669e0466","target":"graph","created_at":"2026-05-17T23:52:31Z","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":"Target search with unmanned aerial vehicles (UAVs) is relevant problem to many scenarios, e.g., search and rescue (SaR). However, a key challenge is planning paths for maximal search efficiency given flight time constraints. To address this, we propose the Obstacle-aware Adaptive Informative Path Planning (OA-IPP) algorithm for target search in cluttered environments using UAVs. Our approach leverages a layered planning strategy using a Gaussian Process (GP)-based model of target occupancy to generate informative paths in continuous 3D space. Within this framework, we introduce an adaptive rep","authors_text":"Ajith Anil Meera, Alexander Millane, Marija Popovic, Roland Siegwart","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-02-26T19:46:42Z","title":"Obstacle-aware Adaptive Informative Path Planning for UAV-based Target Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.10182","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:19042ed8365612422d181508fdc9dbad019ddf4d56f8a70be20391a71ae9c090","target":"record","created_at":"2026-05-17T23:52:31Z","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":"0a0da162c37fb221a8c1e09c1d034b29e657a4fda8c3dc2691e9238ca272d94c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-02-26T19:46:42Z","title_canon_sha256":"012c3ee0eb4c8203278e12681b2a3c5d75d32701601e0ea74c103e9c7f5e3c0e"},"schema_version":"1.0","source":{"id":"1902.10182","kind":"arxiv","version":1}},"canonical_sha256":"f573ba78305cddea3dd57bd0808913866f8031c135e0523964248c324cf6ac2c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f573ba78305cddea3dd57bd0808913866f8031c135e0523964248c324cf6ac2c","first_computed_at":"2026-05-17T23:52:31.547511Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:31.547511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VRoAnYv8CRAsG4NKIXj3pde3L2bxcm//bymynKahyCJIojzJeViQMfRB+Cz3A5IWUas4y4/ozRVRwlbIna1aBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:31.548047Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.10182","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:19042ed8365612422d181508fdc9dbad019ddf4d56f8a70be20391a71ae9c090","sha256:4b7f849e52e0d2f241dd43e0a4115d102d982933911481384d2e453f669e0466"],"state_sha256":"326baa8a1fa075e14687c5438bbaf033312737b504caa30a3bebd27e86c067ad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G4+6O3iT4a3owyVXWPivscVUnh0yTgneQ/wpUL19Ez/X9lY74juSGJNoU69x9hsf+6StUyVu0xhiRlalrUFDDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T00:41:13.654017Z","bundle_sha256":"3d25a245d061b4aed198f1103e5b4ee9bea807113946aca7820a863dab0be4d9"}}