{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:DKVPE76TXP7TBGPZAM4IQNVXTX","short_pith_number":"pith:DKVPE76T","canonical_record":{"source":{"id":"1607.01883","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-07-07T06:52:15Z","cross_cats_sorted":[],"title_canon_sha256":"4c60342462d0d87b69d5876b7cab28a2ca43edc4912dd9a247990fd918ab526d","abstract_canon_sha256":"1c34ccff341f28a99c094277d319ca52d074c44dd27a7be3db865188f7e817c1"},"schema_version":"1.0"},"canonical_sha256":"1aaaf27fd3bbff3099f903388836b79dca82167172b408c378039714a976055c","source":{"kind":"arxiv","id":"1607.01883","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.01883","created_at":"2026-05-17T23:45:21Z"},{"alias_kind":"arxiv_version","alias_value":"1607.01883v5","created_at":"2026-05-17T23:45:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.01883","created_at":"2026-05-17T23:45:21Z"},{"alias_kind":"pith_short_12","alias_value":"DKVPE76TXP7T","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DKVPE76TXP7TBGPZ","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DKVPE76T","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:DKVPE76TXP7TBGPZAM4IQNVXTX","target":"record","payload":{"canonical_record":{"source":{"id":"1607.01883","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-07-07T06:52:15Z","cross_cats_sorted":[],"title_canon_sha256":"4c60342462d0d87b69d5876b7cab28a2ca43edc4912dd9a247990fd918ab526d","abstract_canon_sha256":"1c34ccff341f28a99c094277d319ca52d074c44dd27a7be3db865188f7e817c1"},"schema_version":"1.0"},"canonical_sha256":"1aaaf27fd3bbff3099f903388836b79dca82167172b408c378039714a976055c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:21.244844Z","signature_b64":"vqVQ3aqK7DS1L8ZTq0kdmMDyCNErXBiVb70X5sZQqAPj0h0YUtwNTVYW5qNYVkr47H3dbUecaZzk2+cApXY5DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1aaaf27fd3bbff3099f903388836b79dca82167172b408c378039714a976055c","last_reissued_at":"2026-05-17T23:45:21.244033Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:21.244033Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.01883","source_version":5,"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:45:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cW7V075sVw7Ujc3Qp3h5bxB74rmW9tXraTQoSkaS+LJ+b5P4c7gV4CxzFoMQMOcojWfQpPBWvQG5gL2EPAmfDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:22:04.013654Z"},"content_sha256":"559c734699099dcb3383c38982313aa6eb103c1168e1f9ff88d3de35900df9bf","schema_version":"1.0","event_id":"sha256:559c734699099dcb3383c38982313aa6eb103c1168e1f9ff88d3de35900df9bf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:DKVPE76TXP7TBGPZAM4IQNVXTX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sampling-based Incremental Information Gathering with Applications to Robotic Exploration and Environmental Monitoring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Gamini Dissanayake, Jaime Valls Miro, Maani Ghaffari Jadidi","submitted_at":"2016-07-07T06:52:15Z","abstract_excerpt":"In this article, we propose a sampling-based motion planning algorithm equipped with an information-theoretic convergence criterion for incremental informative motion planning. The proposed approach allows dense map representations and incorporates the full state uncertainty into the planning process. The problem is formulated as a constrained maximization problem. Our approach is built on rapidly-exploring information gathering algorithms and benefits from advantages of sampling-based optimal motion planning algorithms. We propose two information functions and their variants for fast and onli"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.01883","kind":"arxiv","version":5},"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:45:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mzdMKtaBltQv8CrkUOwVdkw/G3cu0TrJ9I7V/d6LRrv3FyzHZ+01yz8n5qg3zUK0euzvP5lb8G6UMEXIImThDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:22:04.014307Z"},"content_sha256":"b123e6afc1e68419f3a4eb51f0a986a86d291ededb7f1e3fab65914344d8b2c1","schema_version":"1.0","event_id":"sha256:b123e6afc1e68419f3a4eb51f0a986a86d291ededb7f1e3fab65914344d8b2c1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DKVPE76TXP7TBGPZAM4IQNVXTX/bundle.json","state_url":"https://pith.science/pith/DKVPE76TXP7TBGPZAM4IQNVXTX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DKVPE76TXP7TBGPZAM4IQNVXTX/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-27T12:22:04Z","links":{"resolver":"https://pith.science/pith/DKVPE76TXP7TBGPZAM4IQNVXTX","bundle":"https://pith.science/pith/DKVPE76TXP7TBGPZAM4IQNVXTX/bundle.json","state":"https://pith.science/pith/DKVPE76TXP7TBGPZAM4IQNVXTX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DKVPE76TXP7TBGPZAM4IQNVXTX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:DKVPE76TXP7TBGPZAM4IQNVXTX","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":"1c34ccff341f28a99c094277d319ca52d074c44dd27a7be3db865188f7e817c1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-07-07T06:52:15Z","title_canon_sha256":"4c60342462d0d87b69d5876b7cab28a2ca43edc4912dd9a247990fd918ab526d"},"schema_version":"1.0","source":{"id":"1607.01883","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.01883","created_at":"2026-05-17T23:45:21Z"},{"alias_kind":"arxiv_version","alias_value":"1607.01883v5","created_at":"2026-05-17T23:45:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.01883","created_at":"2026-05-17T23:45:21Z"},{"alias_kind":"pith_short_12","alias_value":"DKVPE76TXP7T","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DKVPE76TXP7TBGPZ","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DKVPE76T","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:b123e6afc1e68419f3a4eb51f0a986a86d291ededb7f1e3fab65914344d8b2c1","target":"graph","created_at":"2026-05-17T23:45:21Z","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":"In this article, we propose a sampling-based motion planning algorithm equipped with an information-theoretic convergence criterion for incremental informative motion planning. The proposed approach allows dense map representations and incorporates the full state uncertainty into the planning process. The problem is formulated as a constrained maximization problem. Our approach is built on rapidly-exploring information gathering algorithms and benefits from advantages of sampling-based optimal motion planning algorithms. We propose two information functions and their variants for fast and onli","authors_text":"Gamini Dissanayake, Jaime Valls Miro, Maani Ghaffari Jadidi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-07-07T06:52:15Z","title":"Sampling-based Incremental Information Gathering with Applications to Robotic Exploration and Environmental Monitoring"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.01883","kind":"arxiv","version":5},"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:559c734699099dcb3383c38982313aa6eb103c1168e1f9ff88d3de35900df9bf","target":"record","created_at":"2026-05-17T23:45:21Z","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":"1c34ccff341f28a99c094277d319ca52d074c44dd27a7be3db865188f7e817c1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-07-07T06:52:15Z","title_canon_sha256":"4c60342462d0d87b69d5876b7cab28a2ca43edc4912dd9a247990fd918ab526d"},"schema_version":"1.0","source":{"id":"1607.01883","kind":"arxiv","version":5}},"canonical_sha256":"1aaaf27fd3bbff3099f903388836b79dca82167172b408c378039714a976055c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1aaaf27fd3bbff3099f903388836b79dca82167172b408c378039714a976055c","first_computed_at":"2026-05-17T23:45:21.244033Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:21.244033Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vqVQ3aqK7DS1L8ZTq0kdmMDyCNErXBiVb70X5sZQqAPj0h0YUtwNTVYW5qNYVkr47H3dbUecaZzk2+cApXY5DA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:21.244844Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.01883","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:559c734699099dcb3383c38982313aa6eb103c1168e1f9ff88d3de35900df9bf","sha256:b123e6afc1e68419f3a4eb51f0a986a86d291ededb7f1e3fab65914344d8b2c1"],"state_sha256":"30f49d7968adb3fb46d87bcd8e96c27c07668f0000d26b1e45272c4b60ecdd11"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AE2vdWvN5ULJfIH24dJkjkpKcTOpn+f0vifB7d+flEJeqLaVGdnrGznVnThoEKoeF9ouH8JD72f9unQHDbVBBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T12:22:04.017876Z","bundle_sha256":"a02ca0dda06daac3b34c94487f58f77bde0bdfae536337ad9017deffd3b399d4"}}