{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:5N7TLMJ6X5EYZJ2RVIT33BZTNR","short_pith_number":"pith:5N7TLMJ6","canonical_record":{"source":{"id":"1808.00593","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-08-01T22:59:47Z","cross_cats_sorted":[],"title_canon_sha256":"085bb915e8d84bcadb9ed1382f1119e669b2c956a3d96c4292ccbb976aa004d5","abstract_canon_sha256":"a3c9a947ed91f4f835dbdb78af2425a181a3445f07236bbe9e8214c81dcf12b5"},"schema_version":"1.0"},"canonical_sha256":"eb7f35b13ebf498ca751aa27bd87336c7e65176f78a16b12064b6404a767a8c8","source":{"kind":"arxiv","id":"1808.00593","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.00593","created_at":"2026-05-18T00:09:04Z"},{"alias_kind":"arxiv_version","alias_value":"1808.00593v1","created_at":"2026-05-18T00:09:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.00593","created_at":"2026-05-18T00:09:04Z"},{"alias_kind":"pith_short_12","alias_value":"5N7TLMJ6X5EY","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5N7TLMJ6X5EYZJ2R","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5N7TLMJ6","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:5N7TLMJ6X5EYZJ2RVIT33BZTNR","target":"record","payload":{"canonical_record":{"source":{"id":"1808.00593","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-08-01T22:59:47Z","cross_cats_sorted":[],"title_canon_sha256":"085bb915e8d84bcadb9ed1382f1119e669b2c956a3d96c4292ccbb976aa004d5","abstract_canon_sha256":"a3c9a947ed91f4f835dbdb78af2425a181a3445f07236bbe9e8214c81dcf12b5"},"schema_version":"1.0"},"canonical_sha256":"eb7f35b13ebf498ca751aa27bd87336c7e65176f78a16b12064b6404a767a8c8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:04.795984Z","signature_b64":"D6IUKLEkfTY3+FoaYKWxSiR3NQ5GyJcjfckw5AfCWV/e2t6RiaZntdswIarU/ShWnZjSYr4jg0VNisRbNmHhCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb7f35b13ebf498ca751aa27bd87336c7e65176f78a16b12064b6404a767a8c8","last_reissued_at":"2026-05-18T00:09:04.795274Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:04.795274Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.00593","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:09:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3u88KOR8rCTDJUxntQwF0VCOkK9CiOwE00kFzeZj9WkzhXDTVndfg56RWo/QltQ1dIEakWVkAsrC09cJxiCKCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T05:43:30.235726Z"},"content_sha256":"d6d0cb446cac3608f3df9d5327b7beb7e4f71b2f2c813ba5930ac6b103502bb2","schema_version":"1.0","event_id":"sha256:d6d0cb446cac3608f3df9d5327b7beb7e4f71b2f2c813ba5930ac6b103502bb2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:5N7TLMJ6X5EYZJ2RVIT33BZTNR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Perception-driven sparse graphs for optimal motion planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Sertac Karaman, Thomas Sayre-McCord","submitted_at":"2018-08-01T22:59:47Z","abstract_excerpt":"Most existing motion planning algorithms assume that a map (of some quality) is fully determined prior to generating a motion plan. In many emerging applications of robotics, e.g., fast-moving agile aerial robots with constrained embedded computational platforms and visual sensors, dense maps of the world are not immediately available, and they are computationally expensive to construct. We propose a new algorithm for generating plan graphs which couples the perception and motion planning processes for computational efficiency. In a nutshell, the proposed algorithm iteratively switches between"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.00593","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:09:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sDCXxbZSOzPFy2e7arDN++w1xR7bWiYDaguUs9cCDIRh2zYxnp4hubDVaIq98Jt/r9VAKwsZ3ih1s8cqFcSuAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T05:43:30.236087Z"},"content_sha256":"5f45909e1ee6c1952efa51d0cc670840d7f00d18af78133b3baca296a8877bb7","schema_version":"1.0","event_id":"sha256:5f45909e1ee6c1952efa51d0cc670840d7f00d18af78133b3baca296a8877bb7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5N7TLMJ6X5EYZJ2RVIT33BZTNR/bundle.json","state_url":"https://pith.science/pith/5N7TLMJ6X5EYZJ2RVIT33BZTNR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5N7TLMJ6X5EYZJ2RVIT33BZTNR/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-08T05:43:30Z","links":{"resolver":"https://pith.science/pith/5N7TLMJ6X5EYZJ2RVIT33BZTNR","bundle":"https://pith.science/pith/5N7TLMJ6X5EYZJ2RVIT33BZTNR/bundle.json","state":"https://pith.science/pith/5N7TLMJ6X5EYZJ2RVIT33BZTNR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5N7TLMJ6X5EYZJ2RVIT33BZTNR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:5N7TLMJ6X5EYZJ2RVIT33BZTNR","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":"a3c9a947ed91f4f835dbdb78af2425a181a3445f07236bbe9e8214c81dcf12b5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-08-01T22:59:47Z","title_canon_sha256":"085bb915e8d84bcadb9ed1382f1119e669b2c956a3d96c4292ccbb976aa004d5"},"schema_version":"1.0","source":{"id":"1808.00593","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.00593","created_at":"2026-05-18T00:09:04Z"},{"alias_kind":"arxiv_version","alias_value":"1808.00593v1","created_at":"2026-05-18T00:09:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.00593","created_at":"2026-05-18T00:09:04Z"},{"alias_kind":"pith_short_12","alias_value":"5N7TLMJ6X5EY","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5N7TLMJ6X5EYZJ2R","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5N7TLMJ6","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:5f45909e1ee6c1952efa51d0cc670840d7f00d18af78133b3baca296a8877bb7","target":"graph","created_at":"2026-05-18T00:09:04Z","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":"Most existing motion planning algorithms assume that a map (of some quality) is fully determined prior to generating a motion plan. In many emerging applications of robotics, e.g., fast-moving agile aerial robots with constrained embedded computational platforms and visual sensors, dense maps of the world are not immediately available, and they are computationally expensive to construct. We propose a new algorithm for generating plan graphs which couples the perception and motion planning processes for computational efficiency. In a nutshell, the proposed algorithm iteratively switches between","authors_text":"Sertac Karaman, Thomas Sayre-McCord","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-08-01T22:59:47Z","title":"Perception-driven sparse graphs for optimal motion planning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.00593","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:d6d0cb446cac3608f3df9d5327b7beb7e4f71b2f2c813ba5930ac6b103502bb2","target":"record","created_at":"2026-05-18T00:09:04Z","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":"a3c9a947ed91f4f835dbdb78af2425a181a3445f07236bbe9e8214c81dcf12b5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-08-01T22:59:47Z","title_canon_sha256":"085bb915e8d84bcadb9ed1382f1119e669b2c956a3d96c4292ccbb976aa004d5"},"schema_version":"1.0","source":{"id":"1808.00593","kind":"arxiv","version":1}},"canonical_sha256":"eb7f35b13ebf498ca751aa27bd87336c7e65176f78a16b12064b6404a767a8c8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eb7f35b13ebf498ca751aa27bd87336c7e65176f78a16b12064b6404a767a8c8","first_computed_at":"2026-05-18T00:09:04.795274Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:04.795274Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"D6IUKLEkfTY3+FoaYKWxSiR3NQ5GyJcjfckw5AfCWV/e2t6RiaZntdswIarU/ShWnZjSYr4jg0VNisRbNmHhCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:04.795984Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.00593","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d6d0cb446cac3608f3df9d5327b7beb7e4f71b2f2c813ba5930ac6b103502bb2","sha256:5f45909e1ee6c1952efa51d0cc670840d7f00d18af78133b3baca296a8877bb7"],"state_sha256":"cc3413de9a480ccba04fe23f881d186f35c03d761a0ac53c82c8eefb5bde9c5c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UuJDqssRPzLGCIKRHkS4utVhyTaU90x5KWuHs0izxfGhrBZ/fwnaEBeZ42tzRQ7oFCLX7wqs8/q/iSIBd4oXDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-08T05:43:30.238131Z","bundle_sha256":"a7e4c84bb595329e9e1914b94675649ab7884c2d951a1133d82a2850c4c3e974"}}