{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:RSU2BDSQYLWXCAQ46NFHDEZGFN","short_pith_number":"pith:RSU2BDSQ","canonical_record":{"source":{"id":"1907.00506","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2019-07-01T01:14:05Z","cross_cats_sorted":[],"title_canon_sha256":"9ac0eacb05925b0b79e45f372f9ad33b0d0c320bb59f5abef471c5360922ded1","abstract_canon_sha256":"fbcb5f96f6a48ee081d1aa6670b131b6d41ab5267fcfca620da563a9f2bbf6e3"},"schema_version":"1.0"},"canonical_sha256":"8ca9a08e50c2ed71021cf34a7193262b64c3f66367bc451635ef6b7630fcc6c0","source":{"kind":"arxiv","id":"1907.00506","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.00506","created_at":"2026-05-17T23:41:51Z"},{"alias_kind":"arxiv_version","alias_value":"1907.00506v1","created_at":"2026-05-17T23:41:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.00506","created_at":"2026-05-17T23:41:51Z"},{"alias_kind":"pith_short_12","alias_value":"RSU2BDSQYLWX","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RSU2BDSQYLWXCAQ4","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RSU2BDSQ","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:RSU2BDSQYLWXCAQ46NFHDEZGFN","target":"record","payload":{"canonical_record":{"source":{"id":"1907.00506","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2019-07-01T01:14:05Z","cross_cats_sorted":[],"title_canon_sha256":"9ac0eacb05925b0b79e45f372f9ad33b0d0c320bb59f5abef471c5360922ded1","abstract_canon_sha256":"fbcb5f96f6a48ee081d1aa6670b131b6d41ab5267fcfca620da563a9f2bbf6e3"},"schema_version":"1.0"},"canonical_sha256":"8ca9a08e50c2ed71021cf34a7193262b64c3f66367bc451635ef6b7630fcc6c0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:51.438131Z","signature_b64":"2K7Nm3zaEbn/+kus/upWoiAdI7pKUsCZEDzrAyDp/xbxqkz57Tylj2vdh5MmpTCF0c1t9N3z6hOV9QOri/KNDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ca9a08e50c2ed71021cf34a7193262b64c3f66367bc451635ef6b7630fcc6c0","last_reissued_at":"2026-05-17T23:41:51.437524Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:51.437524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.00506","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:41:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5aSSPI0+Ox9GM1wd33tywnqDOi5ykk2rLfGSF6eq7hgiI4ot7XPWGqGHRQavlqU5lc5pFMmoWhpao/I29LaaAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T00:59:35.534883Z"},"content_sha256":"c1ae07694a0b885ff307830486c6803289c4fee411dd4b0702afbfc2403aeac1","schema_version":"1.0","event_id":"sha256:c1ae07694a0b885ff307830486c6803289c4fee411dd4b0702afbfc2403aeac1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:RSU2BDSQYLWXCAQ46NFHDEZGFN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Toward Asymptotically-Optimal Inspection Planning via Efficient Near-Optimal Graph Search","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Alan Kuntz, Mengyu Fu, Oren Salzman, Ron Alterovitz","submitted_at":"2019-07-01T01:14:05Z","abstract_excerpt":"Inspection planning, the task of planning motions that allow a robot to inspect a set of points of interest, has applications in domains such as industrial, field, and medical robotics. Inspection planning can be computationally challenging, as the search space over motion plans that inspect the points of interest grows exponentially with the number of inspected points. We propose a novel method, Incremental Random Inspection-roadmap Search (IRIS), that computes inspection plans whose length and set of inspected points asymptotically converge to those of an optimal inspection plan. IRIS increm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.00506","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:41:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZgUIBwBncEepBCH/hhVoIY/TFv4jIn+k7/YLRHZpmIHjl91NUX9q7Ti6Qoqow/JMmOLFp3IO/PvV2v0xKO+WDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T00:59:35.535235Z"},"content_sha256":"e7a13ee9128bea3e1fe45579380c3f650c2468e1d85f175be643c9ee90f28659","schema_version":"1.0","event_id":"sha256:e7a13ee9128bea3e1fe45579380c3f650c2468e1d85f175be643c9ee90f28659"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RSU2BDSQYLWXCAQ46NFHDEZGFN/bundle.json","state_url":"https://pith.science/pith/RSU2BDSQYLWXCAQ46NFHDEZGFN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RSU2BDSQYLWXCAQ46NFHDEZGFN/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-28T00:59:35Z","links":{"resolver":"https://pith.science/pith/RSU2BDSQYLWXCAQ46NFHDEZGFN","bundle":"https://pith.science/pith/RSU2BDSQYLWXCAQ46NFHDEZGFN/bundle.json","state":"https://pith.science/pith/RSU2BDSQYLWXCAQ46NFHDEZGFN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RSU2BDSQYLWXCAQ46NFHDEZGFN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:RSU2BDSQYLWXCAQ46NFHDEZGFN","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":"fbcb5f96f6a48ee081d1aa6670b131b6d41ab5267fcfca620da563a9f2bbf6e3","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2019-07-01T01:14:05Z","title_canon_sha256":"9ac0eacb05925b0b79e45f372f9ad33b0d0c320bb59f5abef471c5360922ded1"},"schema_version":"1.0","source":{"id":"1907.00506","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.00506","created_at":"2026-05-17T23:41:51Z"},{"alias_kind":"arxiv_version","alias_value":"1907.00506v1","created_at":"2026-05-17T23:41:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.00506","created_at":"2026-05-17T23:41:51Z"},{"alias_kind":"pith_short_12","alias_value":"RSU2BDSQYLWX","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RSU2BDSQYLWXCAQ4","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RSU2BDSQ","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:e7a13ee9128bea3e1fe45579380c3f650c2468e1d85f175be643c9ee90f28659","target":"graph","created_at":"2026-05-17T23:41:51Z","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":"Inspection planning, the task of planning motions that allow a robot to inspect a set of points of interest, has applications in domains such as industrial, field, and medical robotics. Inspection planning can be computationally challenging, as the search space over motion plans that inspect the points of interest grows exponentially with the number of inspected points. We propose a novel method, Incremental Random Inspection-roadmap Search (IRIS), that computes inspection plans whose length and set of inspected points asymptotically converge to those of an optimal inspection plan. IRIS increm","authors_text":"Alan Kuntz, Mengyu Fu, Oren Salzman, Ron Alterovitz","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2019-07-01T01:14:05Z","title":"Toward Asymptotically-Optimal Inspection Planning via Efficient Near-Optimal Graph Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.00506","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:c1ae07694a0b885ff307830486c6803289c4fee411dd4b0702afbfc2403aeac1","target":"record","created_at":"2026-05-17T23:41:51Z","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":"fbcb5f96f6a48ee081d1aa6670b131b6d41ab5267fcfca620da563a9f2bbf6e3","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2019-07-01T01:14:05Z","title_canon_sha256":"9ac0eacb05925b0b79e45f372f9ad33b0d0c320bb59f5abef471c5360922ded1"},"schema_version":"1.0","source":{"id":"1907.00506","kind":"arxiv","version":1}},"canonical_sha256":"8ca9a08e50c2ed71021cf34a7193262b64c3f66367bc451635ef6b7630fcc6c0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8ca9a08e50c2ed71021cf34a7193262b64c3f66367bc451635ef6b7630fcc6c0","first_computed_at":"2026-05-17T23:41:51.437524Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:51.437524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2K7Nm3zaEbn/+kus/upWoiAdI7pKUsCZEDzrAyDp/xbxqkz57Tylj2vdh5MmpTCF0c1t9N3z6hOV9QOri/KNDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:51.438131Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.00506","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c1ae07694a0b885ff307830486c6803289c4fee411dd4b0702afbfc2403aeac1","sha256:e7a13ee9128bea3e1fe45579380c3f650c2468e1d85f175be643c9ee90f28659"],"state_sha256":"6925c3edbe4f298487d84c30cd16b7a439efbf33bea21b3094753885a00ee70b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UyaS193KIY9x9pZhsDU1kEW9ALwywg0St9gErMGkknJiq3r6cmq2g9xUbs6502mqq8l3WusncnCxX90w8PXMBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T00:59:35.537190Z","bundle_sha256":"68486d80c21b8aeb576351e9090cedc963ad58bf3e04b9dae1e6d81e43f16747"}}