{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:5X4IFG6ZXRXZF34OH6V3XA242G","short_pith_number":"pith:5X4IFG6Z","canonical_record":{"source":{"id":"1901.07272","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-01-22T11:42:41Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"ab99c0008148abee2ed2cd5704b2b4c78251f37fc7991fce0451c16c4e0eff4c","abstract_canon_sha256":"15a510f3ba84dda9efc46131f4575e53b3b3da3cb18d6d6ff084c5b18bf4bece"},"schema_version":"1.0"},"canonical_sha256":"edf8829bd9bc6f92ef8e3fabbb835cd193a6717b3070054a0324e4f875b853dc","source":{"kind":"arxiv","id":"1901.07272","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.07272","created_at":"2026-05-17T23:55:47Z"},{"alias_kind":"arxiv_version","alias_value":"1901.07272v1","created_at":"2026-05-17T23:55:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07272","created_at":"2026-05-17T23:55:47Z"},{"alias_kind":"pith_short_12","alias_value":"5X4IFG6ZXRXZ","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5X4IFG6ZXRXZF34O","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5X4IFG6Z","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:5X4IFG6ZXRXZF34OH6V3XA242G","target":"record","payload":{"canonical_record":{"source":{"id":"1901.07272","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-01-22T11:42:41Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"ab99c0008148abee2ed2cd5704b2b4c78251f37fc7991fce0451c16c4e0eff4c","abstract_canon_sha256":"15a510f3ba84dda9efc46131f4575e53b3b3da3cb18d6d6ff084c5b18bf4bece"},"schema_version":"1.0"},"canonical_sha256":"edf8829bd9bc6f92ef8e3fabbb835cd193a6717b3070054a0324e4f875b853dc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:47.556296Z","signature_b64":"trz48sMRWABpT80ui6HsHYvSZuNgsBJsIOtOp98bGDFXU9vMDHWRdaBsUrhrZir9FdJM07ERHYNxSc5cOYAlCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"edf8829bd9bc6f92ef8e3fabbb835cd193a6717b3070054a0324e4f875b853dc","last_reissued_at":"2026-05-17T23:55:47.555637Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:47.555637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.07272","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:55:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4+ux7S11ivtqplb3APp7q7lnLGs9GikFJZYPugECJHj1faFuiTsLFQyGqDGbMY3VkHPJWSuaP2zvNZMJtq8hDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:21:55.403593Z"},"content_sha256":"e73bea4d5862fa2c1d32ae36d57626d36622da3cec96dc179194057eabf0bb8e","schema_version":"1.0","event_id":"sha256:e73bea4d5862fa2c1d32ae36d57626d36622da3cec96dc179194057eabf0bb8e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:5X4IFG6ZXRXZF34OH6V3XA242G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multiobjective Coverage Path Planning: Enabling Automated Inspection of Complex, Real-World Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.AI","authors_text":"Herman A. Lepikson, Jan C. Albiez, Kai Olav Ellefsen","submitted_at":"2019-01-22T11:42:41Z","abstract_excerpt":"An important open problem in robotic planning is the autonomous generation of 3D inspection paths -- that is, planning the best path to move a robot along in order to inspect a target structure. We recently suggested a new method for planning paths allowing the inspection of complex 3D structures, given a triangular mesh model of the structure. The method differs from previous approaches in its emphasis on generating and considering also plans that result in imperfect coverage of the inspection target. In many practical tasks, one would accept imperfections in coverage if this results in a sub"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07272","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:55:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pXBiAGX4bTJ8vKrfNcc0skMvtt2G9lB421OLtQEdNHCaG7X0wciSIkISTh+gujPyng8WQvI0TGOQP9WYOdlEAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:21:55.403943Z"},"content_sha256":"d79de442588f70de9a1ecc2fde594991c1ee4902d70be3d3ac1cfed7c27240ad","schema_version":"1.0","event_id":"sha256:d79de442588f70de9a1ecc2fde594991c1ee4902d70be3d3ac1cfed7c27240ad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5X4IFG6ZXRXZF34OH6V3XA242G/bundle.json","state_url":"https://pith.science/pith/5X4IFG6ZXRXZF34OH6V3XA242G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5X4IFG6ZXRXZF34OH6V3XA242G/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-31T08:21:55Z","links":{"resolver":"https://pith.science/pith/5X4IFG6ZXRXZF34OH6V3XA242G","bundle":"https://pith.science/pith/5X4IFG6ZXRXZF34OH6V3XA242G/bundle.json","state":"https://pith.science/pith/5X4IFG6ZXRXZF34OH6V3XA242G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5X4IFG6ZXRXZF34OH6V3XA242G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:5X4IFG6ZXRXZF34OH6V3XA242G","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":"15a510f3ba84dda9efc46131f4575e53b3b3da3cb18d6d6ff084c5b18bf4bece","cross_cats_sorted":["cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-01-22T11:42:41Z","title_canon_sha256":"ab99c0008148abee2ed2cd5704b2b4c78251f37fc7991fce0451c16c4e0eff4c"},"schema_version":"1.0","source":{"id":"1901.07272","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.07272","created_at":"2026-05-17T23:55:47Z"},{"alias_kind":"arxiv_version","alias_value":"1901.07272v1","created_at":"2026-05-17T23:55:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07272","created_at":"2026-05-17T23:55:47Z"},{"alias_kind":"pith_short_12","alias_value":"5X4IFG6ZXRXZ","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5X4IFG6ZXRXZF34O","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5X4IFG6Z","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:d79de442588f70de9a1ecc2fde594991c1ee4902d70be3d3ac1cfed7c27240ad","target":"graph","created_at":"2026-05-17T23:55:47Z","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":"An important open problem in robotic planning is the autonomous generation of 3D inspection paths -- that is, planning the best path to move a robot along in order to inspect a target structure. We recently suggested a new method for planning paths allowing the inspection of complex 3D structures, given a triangular mesh model of the structure. The method differs from previous approaches in its emphasis on generating and considering also plans that result in imperfect coverage of the inspection target. In many practical tasks, one would accept imperfections in coverage if this results in a sub","authors_text":"Herman A. Lepikson, Jan C. Albiez, Kai Olav Ellefsen","cross_cats":["cs.RO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-01-22T11:42:41Z","title":"Multiobjective Coverage Path Planning: Enabling Automated Inspection of Complex, Real-World Structures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07272","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:e73bea4d5862fa2c1d32ae36d57626d36622da3cec96dc179194057eabf0bb8e","target":"record","created_at":"2026-05-17T23:55:47Z","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":"15a510f3ba84dda9efc46131f4575e53b3b3da3cb18d6d6ff084c5b18bf4bece","cross_cats_sorted":["cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-01-22T11:42:41Z","title_canon_sha256":"ab99c0008148abee2ed2cd5704b2b4c78251f37fc7991fce0451c16c4e0eff4c"},"schema_version":"1.0","source":{"id":"1901.07272","kind":"arxiv","version":1}},"canonical_sha256":"edf8829bd9bc6f92ef8e3fabbb835cd193a6717b3070054a0324e4f875b853dc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"edf8829bd9bc6f92ef8e3fabbb835cd193a6717b3070054a0324e4f875b853dc","first_computed_at":"2026-05-17T23:55:47.555637Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:47.555637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"trz48sMRWABpT80ui6HsHYvSZuNgsBJsIOtOp98bGDFXU9vMDHWRdaBsUrhrZir9FdJM07ERHYNxSc5cOYAlCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:47.556296Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.07272","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e73bea4d5862fa2c1d32ae36d57626d36622da3cec96dc179194057eabf0bb8e","sha256:d79de442588f70de9a1ecc2fde594991c1ee4902d70be3d3ac1cfed7c27240ad"],"state_sha256":"b841b0b2e8457171889d46d3cf2e6cf52ac5632a5b547dd277d8da3c237e84cb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HPMO/uK7gIGt7fP5qbMcNn/B43cb5EZ1vJdbWNfeQr822jLMOgXIqNu+84fEBTdkOhnPIlqP4khauroU8+k6Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T08:21:55.405943Z","bundle_sha256":"8d3475947eda3c047a40f90dbbd88b3cd48a90b46a2455113c84a1d752dc7190"}}