{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:RCEPLTNXOZT3HSCCJMGQDJRNWM","short_pith_number":"pith:RCEPLTNX","canonical_record":{"source":{"id":"1905.05528","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-05-14T11:42:37Z","cross_cats_sorted":[],"title_canon_sha256":"28bf1556adf4a726dc4de79f7497d38f75be8e48d96fb4388c2534a4d4b71412","abstract_canon_sha256":"d057bc6eb78c421cc3c0a75a83b56f0c1c6828f15006e765295c96e3cdd355b1"},"schema_version":"1.0"},"canonical_sha256":"8888f5cdb77667b3c8424b0d01a62db30ebc097b49445ae72840cb69271debd4","source":{"kind":"arxiv","id":"1905.05528","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.05528","created_at":"2026-05-17T23:46:16Z"},{"alias_kind":"arxiv_version","alias_value":"1905.05528v1","created_at":"2026-05-17T23:46:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.05528","created_at":"2026-05-17T23:46:16Z"},{"alias_kind":"pith_short_12","alias_value":"RCEPLTNXOZT3","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RCEPLTNXOZT3HSCC","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RCEPLTNX","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:RCEPLTNXOZT3HSCCJMGQDJRNWM","target":"record","payload":{"canonical_record":{"source":{"id":"1905.05528","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-05-14T11:42:37Z","cross_cats_sorted":[],"title_canon_sha256":"28bf1556adf4a726dc4de79f7497d38f75be8e48d96fb4388c2534a4d4b71412","abstract_canon_sha256":"d057bc6eb78c421cc3c0a75a83b56f0c1c6828f15006e765295c96e3cdd355b1"},"schema_version":"1.0"},"canonical_sha256":"8888f5cdb77667b3c8424b0d01a62db30ebc097b49445ae72840cb69271debd4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:16.244612Z","signature_b64":"zR1Lhx8kRtOvVoLxef72FMap1xAAKzWi6M5IvrTU4wGwHVSJs5krNVrDCl8SmaWrcKhsNL4C081Yl8kSZcRiCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8888f5cdb77667b3c8424b0d01a62db30ebc097b49445ae72840cb69271debd4","last_reissued_at":"2026-05-17T23:46:16.243983Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:16.243983Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.05528","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:46:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P6UOi3wROL83RIbgozjn2GQIfnmFi+pDPPC8swkMy9BgkPXUL8t3S9+ESGbV09SwDKPFXhSGGHDAgTooXAP0DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-18T02:46:05.757828Z"},"content_sha256":"649e91043eced2d6031c78d902338839262174b689d152bbbe0c9820d5c8c6de","schema_version":"1.0","event_id":"sha256:649e91043eced2d6031c78d902338839262174b689d152bbbe0c9820d5c8c6de"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:RCEPLTNXOZT3HSCCJMGQDJRNWM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Near-Optimal Path Planning for Complex Robotic Inspection Tasks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Boris Bogaerts, Rudi Penne, Seppe Sels, Steve Vanlanduit","submitted_at":"2019-05-14T11:42:37Z","abstract_excerpt":"In this paper, we consider the problem of generating inspection paths for robots. These paths should allow an attached measurement device to perform high-quality measurements. We formally show that generating robot paths, while maximizing the inspection quality, naturally corresponds to the submodular orienteering problem. Traditional methods that are able to generate solutions with mathematical guarantees do not scale to real-world problems. In this work, we propose a method that is able to generate near-optimal solutions for real-world complex problems. We experimentally test this method in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.05528","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:46:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aWk6QrmyOo+DTPBxUj4begBLk3K3VGC7gCj6pvynYq2Fu4kshOPJoq354ILHDfjwuYNdtdcjtoATfOc+gcUwCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-18T02:46:05.758166Z"},"content_sha256":"5a672a221a51468db3a5ef024c50f38b9cef068f04fb7f132cc029a6a732954d","schema_version":"1.0","event_id":"sha256:5a672a221a51468db3a5ef024c50f38b9cef068f04fb7f132cc029a6a732954d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RCEPLTNXOZT3HSCCJMGQDJRNWM/bundle.json","state_url":"https://pith.science/pith/RCEPLTNXOZT3HSCCJMGQDJRNWM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RCEPLTNXOZT3HSCCJMGQDJRNWM/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-18T02:46:05Z","links":{"resolver":"https://pith.science/pith/RCEPLTNXOZT3HSCCJMGQDJRNWM","bundle":"https://pith.science/pith/RCEPLTNXOZT3HSCCJMGQDJRNWM/bundle.json","state":"https://pith.science/pith/RCEPLTNXOZT3HSCCJMGQDJRNWM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RCEPLTNXOZT3HSCCJMGQDJRNWM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:RCEPLTNXOZT3HSCCJMGQDJRNWM","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":"d057bc6eb78c421cc3c0a75a83b56f0c1c6828f15006e765295c96e3cdd355b1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-05-14T11:42:37Z","title_canon_sha256":"28bf1556adf4a726dc4de79f7497d38f75be8e48d96fb4388c2534a4d4b71412"},"schema_version":"1.0","source":{"id":"1905.05528","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.05528","created_at":"2026-05-17T23:46:16Z"},{"alias_kind":"arxiv_version","alias_value":"1905.05528v1","created_at":"2026-05-17T23:46:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.05528","created_at":"2026-05-17T23:46:16Z"},{"alias_kind":"pith_short_12","alias_value":"RCEPLTNXOZT3","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RCEPLTNXOZT3HSCC","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RCEPLTNX","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:5a672a221a51468db3a5ef024c50f38b9cef068f04fb7f132cc029a6a732954d","target":"graph","created_at":"2026-05-17T23:46:16Z","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 paper, we consider the problem of generating inspection paths for robots. These paths should allow an attached measurement device to perform high-quality measurements. We formally show that generating robot paths, while maximizing the inspection quality, naturally corresponds to the submodular orienteering problem. Traditional methods that are able to generate solutions with mathematical guarantees do not scale to real-world problems. In this work, we propose a method that is able to generate near-optimal solutions for real-world complex problems. We experimentally test this method in ","authors_text":"Boris Bogaerts, Rudi Penne, Seppe Sels, Steve Vanlanduit","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-05-14T11:42:37Z","title":"Near-Optimal Path Planning for Complex Robotic Inspection Tasks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.05528","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:649e91043eced2d6031c78d902338839262174b689d152bbbe0c9820d5c8c6de","target":"record","created_at":"2026-05-17T23:46:16Z","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":"d057bc6eb78c421cc3c0a75a83b56f0c1c6828f15006e765295c96e3cdd355b1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-05-14T11:42:37Z","title_canon_sha256":"28bf1556adf4a726dc4de79f7497d38f75be8e48d96fb4388c2534a4d4b71412"},"schema_version":"1.0","source":{"id":"1905.05528","kind":"arxiv","version":1}},"canonical_sha256":"8888f5cdb77667b3c8424b0d01a62db30ebc097b49445ae72840cb69271debd4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8888f5cdb77667b3c8424b0d01a62db30ebc097b49445ae72840cb69271debd4","first_computed_at":"2026-05-17T23:46:16.243983Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:16.243983Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zR1Lhx8kRtOvVoLxef72FMap1xAAKzWi6M5IvrTU4wGwHVSJs5krNVrDCl8SmaWrcKhsNL4C081Yl8kSZcRiCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:16.244612Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.05528","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:649e91043eced2d6031c78d902338839262174b689d152bbbe0c9820d5c8c6de","sha256:5a672a221a51468db3a5ef024c50f38b9cef068f04fb7f132cc029a6a732954d"],"state_sha256":"fc86984fa44daa6f911ba3a6feef6a996c0993d44e37c8eda83eedd8265b1f1f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oVee2FBvDZ9NEoubTn+3aE1ZvR7kN7ZjhDSU1S3A406xLtKi4FRKEkVgw2UEvIacwtORCWgeiU6FcmvLGvJMCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-18T02:46:05.760176Z","bundle_sha256":"ec781beacb981b825ff617d46d559331d6055f3e383cb478510430343c7a9cac"}}