{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:HX4MPQUZIWXBCGF6I2PHIPBTDV","short_pith_number":"pith:HX4MPQUZ","canonical_record":{"source":{"id":"1808.02541","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.RO","submitted_at":"2018-08-07T20:24:29Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"7fe233069e5a6cb7553f44895f0348d286205d73b2bbbb164f9d9e196f4d0d2b","abstract_canon_sha256":"071cb1bba37d4c2b2c53f67cdd6ceb35119c3279cca202e830b75d9a14cb0fa8"},"schema_version":"1.0"},"canonical_sha256":"3df8c7c29945ae1118be469e743c331d5c5b4309dce5c78cd7a6eb49ddceb460","source":{"kind":"arxiv","id":"1808.02541","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.02541","created_at":"2026-05-18T00:08:35Z"},{"alias_kind":"arxiv_version","alias_value":"1808.02541v1","created_at":"2026-05-18T00:08:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.02541","created_at":"2026-05-18T00:08:35Z"},{"alias_kind":"pith_short_12","alias_value":"HX4MPQUZIWXB","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HX4MPQUZIWXBCGF6","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HX4MPQUZ","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:HX4MPQUZIWXBCGF6I2PHIPBTDV","target":"record","payload":{"canonical_record":{"source":{"id":"1808.02541","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.RO","submitted_at":"2018-08-07T20:24:29Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"7fe233069e5a6cb7553f44895f0348d286205d73b2bbbb164f9d9e196f4d0d2b","abstract_canon_sha256":"071cb1bba37d4c2b2c53f67cdd6ceb35119c3279cca202e830b75d9a14cb0fa8"},"schema_version":"1.0"},"canonical_sha256":"3df8c7c29945ae1118be469e743c331d5c5b4309dce5c78cd7a6eb49ddceb460","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:35.095011Z","signature_b64":"xHpiaJhQ3grpOR6epoGQtxy+deGEYgkgjuPinc5CxI8FzOxshU+VP+hl4LLnmeYAQMPIkZMsoqTZxq40fF+eBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3df8c7c29945ae1118be469e743c331d5c5b4309dce5c78cd7a6eb49ddceb460","last_reissued_at":"2026-05-18T00:08:35.094401Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:35.094401Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.02541","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:08:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X9w5hXIjWsmVBnCEJOZzDcnKF8/flNYpyOxJavs5NURptZe1MYyagFMT8RJG9mtYJfaHM95HIYuZJXXVq7XGBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T18:22:04.759070Z"},"content_sha256":"2b82a59c3bfe0c8ac1aa18f443dd13603e752c1affa0eaa6714e971dee89e4b5","schema_version":"1.0","event_id":"sha256:2b82a59c3bfe0c8ac1aa18f443dd13603e752c1affa0eaa6714e971dee89e4b5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:HX4MPQUZIWXBCGF6I2PHIPBTDV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Multi-Robot Coverage of a Known Environment","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.RO","authors_text":"Chris McKinney, Ioannis Rekleitis, Kelly Benson, Nare Karapetyan, Perouz Taslakian","submitted_at":"2018-08-07T20:24:29Z","abstract_excerpt":"This paper addresses the complete area coverage problem of a known environment by multiple-robots. Complete area coverage is the problem of moving an end-effector over all available space while avoiding existing obstacles. In such tasks, using multiple robots can increase the efficiency of the area coverage in terms of minimizing the operational time and increase the robustness in the face of robot attrition. Unfortunately, the problem of finding an optimal solution for such an area coverage problem with multiple robots is known to be NP-complete. In this paper we present two approximation heu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.02541","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:08:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ID6H1hEHtNqHS+f8etArQKO3Fq5zvhJsR4yA/ZIF8/ltEUSbRtvLZWljEkDD59EnMC2MFpC8eQz9Xb17dryQAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T18:22:04.759769Z"},"content_sha256":"af73cd02fc49e1411d7515f966c74474c4351482de5c99695f1c532ecc149909","schema_version":"1.0","event_id":"sha256:af73cd02fc49e1411d7515f966c74474c4351482de5c99695f1c532ecc149909"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HX4MPQUZIWXBCGF6I2PHIPBTDV/bundle.json","state_url":"https://pith.science/pith/HX4MPQUZIWXBCGF6I2PHIPBTDV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HX4MPQUZIWXBCGF6I2PHIPBTDV/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-28T18:22:04Z","links":{"resolver":"https://pith.science/pith/HX4MPQUZIWXBCGF6I2PHIPBTDV","bundle":"https://pith.science/pith/HX4MPQUZIWXBCGF6I2PHIPBTDV/bundle.json","state":"https://pith.science/pith/HX4MPQUZIWXBCGF6I2PHIPBTDV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HX4MPQUZIWXBCGF6I2PHIPBTDV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:HX4MPQUZIWXBCGF6I2PHIPBTDV","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":"071cb1bba37d4c2b2c53f67cdd6ceb35119c3279cca202e830b75d9a14cb0fa8","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.RO","submitted_at":"2018-08-07T20:24:29Z","title_canon_sha256":"7fe233069e5a6cb7553f44895f0348d286205d73b2bbbb164f9d9e196f4d0d2b"},"schema_version":"1.0","source":{"id":"1808.02541","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.02541","created_at":"2026-05-18T00:08:35Z"},{"alias_kind":"arxiv_version","alias_value":"1808.02541v1","created_at":"2026-05-18T00:08:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.02541","created_at":"2026-05-18T00:08:35Z"},{"alias_kind":"pith_short_12","alias_value":"HX4MPQUZIWXB","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HX4MPQUZIWXBCGF6","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HX4MPQUZ","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:af73cd02fc49e1411d7515f966c74474c4351482de5c99695f1c532ecc149909","target":"graph","created_at":"2026-05-18T00:08:35Z","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":"This paper addresses the complete area coverage problem of a known environment by multiple-robots. Complete area coverage is the problem of moving an end-effector over all available space while avoiding existing obstacles. In such tasks, using multiple robots can increase the efficiency of the area coverage in terms of minimizing the operational time and increase the robustness in the face of robot attrition. Unfortunately, the problem of finding an optimal solution for such an area coverage problem with multiple robots is known to be NP-complete. In this paper we present two approximation heu","authors_text":"Chris McKinney, Ioannis Rekleitis, Kelly Benson, Nare Karapetyan, Perouz Taslakian","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.RO","submitted_at":"2018-08-07T20:24:29Z","title":"Efficient Multi-Robot Coverage of a Known Environment"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.02541","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:2b82a59c3bfe0c8ac1aa18f443dd13603e752c1affa0eaa6714e971dee89e4b5","target":"record","created_at":"2026-05-18T00:08:35Z","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":"071cb1bba37d4c2b2c53f67cdd6ceb35119c3279cca202e830b75d9a14cb0fa8","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.RO","submitted_at":"2018-08-07T20:24:29Z","title_canon_sha256":"7fe233069e5a6cb7553f44895f0348d286205d73b2bbbb164f9d9e196f4d0d2b"},"schema_version":"1.0","source":{"id":"1808.02541","kind":"arxiv","version":1}},"canonical_sha256":"3df8c7c29945ae1118be469e743c331d5c5b4309dce5c78cd7a6eb49ddceb460","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3df8c7c29945ae1118be469e743c331d5c5b4309dce5c78cd7a6eb49ddceb460","first_computed_at":"2026-05-18T00:08:35.094401Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:35.094401Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xHpiaJhQ3grpOR6epoGQtxy+deGEYgkgjuPinc5CxI8FzOxshU+VP+hl4LLnmeYAQMPIkZMsoqTZxq40fF+eBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:35.095011Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.02541","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2b82a59c3bfe0c8ac1aa18f443dd13603e752c1affa0eaa6714e971dee89e4b5","sha256:af73cd02fc49e1411d7515f966c74474c4351482de5c99695f1c532ecc149909"],"state_sha256":"1dc99367b316763b63b27dc602b99f0459a0b75e14b5b3e5dba51f9520d45904"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cNgA7rkIERNCtycunxb9ue2L3M4+MwRUtbFIjE1nXp1sw45UnolkgvD2r2gF+WhlreeLDXrG33u4NCL0wSsNCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T18:22:04.763598Z","bundle_sha256":"db376c2111823b7ca62f66b8fe3fa627052a6c485c52650aa20e0e2561b0e230"}}