{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:W7VSBSIC4ZC6IHAEXHIMJUVPXB","short_pith_number":"pith:W7VSBSIC","canonical_record":{"source":{"id":"1903.04300","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-03-11T13:52:57Z","cross_cats_sorted":["cs.DS","cs.MA"],"title_canon_sha256":"0012e0173630a06d2157ca9e7aa900454375f41723e30ad57f8e960ce8540043","abstract_canon_sha256":"0ab03d6f1110666058d90755528a75381cd2bd3d9eb4addf7620c90c23332884"},"schema_version":"1.0"},"canonical_sha256":"b7eb20c902e645e41c04b9d0c4d2afb85310058b42eab8b2d0f7260fdae25e71","source":{"kind":"arxiv","id":"1903.04300","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.04300","created_at":"2026-05-17T23:51:35Z"},{"alias_kind":"arxiv_version","alias_value":"1903.04300v1","created_at":"2026-05-17T23:51:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.04300","created_at":"2026-05-17T23:51:35Z"},{"alias_kind":"pith_short_12","alias_value":"W7VSBSIC4ZC6","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"W7VSBSIC4ZC6IHAE","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"W7VSBSIC","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:W7VSBSIC4ZC6IHAEXHIMJUVPXB","target":"record","payload":{"canonical_record":{"source":{"id":"1903.04300","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-03-11T13:52:57Z","cross_cats_sorted":["cs.DS","cs.MA"],"title_canon_sha256":"0012e0173630a06d2157ca9e7aa900454375f41723e30ad57f8e960ce8540043","abstract_canon_sha256":"0ab03d6f1110666058d90755528a75381cd2bd3d9eb4addf7620c90c23332884"},"schema_version":"1.0"},"canonical_sha256":"b7eb20c902e645e41c04b9d0c4d2afb85310058b42eab8b2d0f7260fdae25e71","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:35.858623Z","signature_b64":"+mSUlVi0ESlhq9O3YD8f6cviM1mexYrenuh81Li0rXK2HjdQECrNC2ian64w2sIF8VHcTcGSdlP/chN3kJZECw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b7eb20c902e645e41c04b9d0c4d2afb85310058b42eab8b2d0f7260fdae25e71","last_reissued_at":"2026-05-17T23:51:35.857872Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:35.857872Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.04300","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:51:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Qi8N/a/PgBzKw35TtRr763ikSyvR8UIxiX2iRLKzhwccsjkW5ty6EhkQkOirAz0vQh7WEZu2fGG6Se9wisiCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:24:47.084095Z"},"content_sha256":"06c8b47a3cb26cab49ec68741b097d9c01b6f4d0640615f0e66789fc3b07e377","schema_version":"1.0","event_id":"sha256:06c8b47a3cb26cab49ec68741b097d9c01b6f4d0640615f0e66789fc3b07e377"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:W7VSBSIC4ZC6IHAEXHIMJUVPXB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reachability and Coverage Planning for Connected Agents: Extended Version","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.MA"],"primary_cat":"cs.AI","authors_text":"Arthur Queffelec, Fran\\c{c}ois Schwarzentruber, Ocan Sankur, Tristan Charrier","submitted_at":"2019-03-11T13:52:57Z","abstract_excerpt":"Motivated by the increasing appeal of robots in information-gathering missions, we study multi-agent path planning problems in which the agents must remain interconnected. We model an area by a topological graph specifying the movement and the connectivity constraints of the agents. We study the theoretical complexity of the reachability and the coverage problems of a fleet of connected agents on various classes of topological graphs. We establish the complexity of these problems on known classes, and introduce a new class called sight-moveable graphs which admit efficient algorithms."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.04300","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:51:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5U1B2R4Dh43oJSaSCO7QfvUMDIVNmpxZDw+tKKV1JEMOnhR0Tj3eEzHv8Li+OLv0idmPcKccRitV93BvBk9lDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:24:47.084452Z"},"content_sha256":"a80408269e6e789c109b19e6fc0b43b94ee9252dee887a35cc81f48f03310fda","schema_version":"1.0","event_id":"sha256:a80408269e6e789c109b19e6fc0b43b94ee9252dee887a35cc81f48f03310fda"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W7VSBSIC4ZC6IHAEXHIMJUVPXB/bundle.json","state_url":"https://pith.science/pith/W7VSBSIC4ZC6IHAEXHIMJUVPXB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W7VSBSIC4ZC6IHAEXHIMJUVPXB/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-31T21:24:47Z","links":{"resolver":"https://pith.science/pith/W7VSBSIC4ZC6IHAEXHIMJUVPXB","bundle":"https://pith.science/pith/W7VSBSIC4ZC6IHAEXHIMJUVPXB/bundle.json","state":"https://pith.science/pith/W7VSBSIC4ZC6IHAEXHIMJUVPXB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W7VSBSIC4ZC6IHAEXHIMJUVPXB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:W7VSBSIC4ZC6IHAEXHIMJUVPXB","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":"0ab03d6f1110666058d90755528a75381cd2bd3d9eb4addf7620c90c23332884","cross_cats_sorted":["cs.DS","cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-03-11T13:52:57Z","title_canon_sha256":"0012e0173630a06d2157ca9e7aa900454375f41723e30ad57f8e960ce8540043"},"schema_version":"1.0","source":{"id":"1903.04300","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.04300","created_at":"2026-05-17T23:51:35Z"},{"alias_kind":"arxiv_version","alias_value":"1903.04300v1","created_at":"2026-05-17T23:51:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.04300","created_at":"2026-05-17T23:51:35Z"},{"alias_kind":"pith_short_12","alias_value":"W7VSBSIC4ZC6","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"W7VSBSIC4ZC6IHAE","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"W7VSBSIC","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:a80408269e6e789c109b19e6fc0b43b94ee9252dee887a35cc81f48f03310fda","target":"graph","created_at":"2026-05-17T23:51: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":"Motivated by the increasing appeal of robots in information-gathering missions, we study multi-agent path planning problems in which the agents must remain interconnected. We model an area by a topological graph specifying the movement and the connectivity constraints of the agents. We study the theoretical complexity of the reachability and the coverage problems of a fleet of connected agents on various classes of topological graphs. We establish the complexity of these problems on known classes, and introduce a new class called sight-moveable graphs which admit efficient algorithms.","authors_text":"Arthur Queffelec, Fran\\c{c}ois Schwarzentruber, Ocan Sankur, Tristan Charrier","cross_cats":["cs.DS","cs.MA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-03-11T13:52:57Z","title":"Reachability and Coverage Planning for Connected Agents: Extended Version"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.04300","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:06c8b47a3cb26cab49ec68741b097d9c01b6f4d0640615f0e66789fc3b07e377","target":"record","created_at":"2026-05-17T23:51: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":"0ab03d6f1110666058d90755528a75381cd2bd3d9eb4addf7620c90c23332884","cross_cats_sorted":["cs.DS","cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-03-11T13:52:57Z","title_canon_sha256":"0012e0173630a06d2157ca9e7aa900454375f41723e30ad57f8e960ce8540043"},"schema_version":"1.0","source":{"id":"1903.04300","kind":"arxiv","version":1}},"canonical_sha256":"b7eb20c902e645e41c04b9d0c4d2afb85310058b42eab8b2d0f7260fdae25e71","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b7eb20c902e645e41c04b9d0c4d2afb85310058b42eab8b2d0f7260fdae25e71","first_computed_at":"2026-05-17T23:51:35.857872Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:35.857872Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+mSUlVi0ESlhq9O3YD8f6cviM1mexYrenuh81Li0rXK2HjdQECrNC2ian64w2sIF8VHcTcGSdlP/chN3kJZECw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:35.858623Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.04300","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:06c8b47a3cb26cab49ec68741b097d9c01b6f4d0640615f0e66789fc3b07e377","sha256:a80408269e6e789c109b19e6fc0b43b94ee9252dee887a35cc81f48f03310fda"],"state_sha256":"3871ea9de1fbfca4fdf703b8518c24fb2a45c96bfa8f9822a590ed4dda68ad8a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aH+F1LrOyBQpOV3jTfDnUQLGK/Jk/FVoUNMnMBqAvAPsOx6GV7iNOxE6ijgtPGBs+8jN5FS76obMgWcshLuPBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T21:24:47.086261Z","bundle_sha256":"c0a2269c966f17b344256e39368fced20d3ba6bae34171ee574f6eb6aec63d63"}}