{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:L7RMCNTS26LXIYQJHHRNVK5CYB","short_pith_number":"pith:L7RMCNTS","schema_version":"1.0","canonical_sha256":"5fe2c13672d79774620939e2daaba2c0709ab7fd087672d3e761f3f333bff54b","source":{"kind":"arxiv","id":"1810.06213","version":1},"attestation_state":"computed","paper":{"title":"Dynamic Connected Cooperative Coverage Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.MA","authors_text":"Eva Soulier, Fran\\c{c}ois Schwarzentruber, Tristan Charrier","submitted_at":"2018-10-15T08:00:34Z","abstract_excerpt":"We study the so-called dynamic coverage problem by agents located in some topological graph. The agents must visit all regions of interest but they also should stay connected to the base via multi-hop. We prove that the algorithmic complexity of this planning problem is PSPACE-complete. Furthermore we prove that the problem becomes NP-complete for bounded plans. We also prove the same complexities for the reachability problem of some positions. We also prove that complexities are maintained for a subclass of topological graphs."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1810.06213","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2018-10-15T08:00:34Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"70f42514dfd12a866f5fd79154cd77584f3f130e675990e7e894f43b1efdf59e","abstract_canon_sha256":"e69701f57a61e24116f5ce09ff59737db827c28617e89a69c0e1e7c7bd769514"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:21.121873Z","signature_b64":"VOCaspK7BnhVpCUqGvZn8tMswiEgu0Y5UDRukFPK794j9Wg9UbLKJwjdlrNhLeOlMWDkNlxXMNSbZ2SZHjeOBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5fe2c13672d79774620939e2daaba2c0709ab7fd087672d3e761f3f333bff54b","last_reissued_at":"2026-05-18T00:03:21.121157Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:21.121157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic Connected Cooperative Coverage Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.MA","authors_text":"Eva Soulier, Fran\\c{c}ois Schwarzentruber, Tristan Charrier","submitted_at":"2018-10-15T08:00:34Z","abstract_excerpt":"We study the so-called dynamic coverage problem by agents located in some topological graph. The agents must visit all regions of interest but they also should stay connected to the base via multi-hop. We prove that the algorithmic complexity of this planning problem is PSPACE-complete. Furthermore we prove that the problem becomes NP-complete for bounded plans. We also prove the same complexities for the reachability problem of some positions. We also prove that complexities are maintained for a subclass of topological graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.06213","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1810.06213","created_at":"2026-05-18T00:03:21.121214+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.06213v1","created_at":"2026-05-18T00:03:21.121214+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.06213","created_at":"2026-05-18T00:03:21.121214+00:00"},{"alias_kind":"pith_short_12","alias_value":"L7RMCNTS26LX","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"L7RMCNTS26LXIYQJ","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"L7RMCNTS","created_at":"2026-05-18T12:32:33.847187+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/L7RMCNTS26LXIYQJHHRNVK5CYB","json":"https://pith.science/pith/L7RMCNTS26LXIYQJHHRNVK5CYB.json","graph_json":"https://pith.science/api/pith-number/L7RMCNTS26LXIYQJHHRNVK5CYB/graph.json","events_json":"https://pith.science/api/pith-number/L7RMCNTS26LXIYQJHHRNVK5CYB/events.json","paper":"https://pith.science/paper/L7RMCNTS"},"agent_actions":{"view_html":"https://pith.science/pith/L7RMCNTS26LXIYQJHHRNVK5CYB","download_json":"https://pith.science/pith/L7RMCNTS26LXIYQJHHRNVK5CYB.json","view_paper":"https://pith.science/paper/L7RMCNTS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.06213&json=true","fetch_graph":"https://pith.science/api/pith-number/L7RMCNTS26LXIYQJHHRNVK5CYB/graph.json","fetch_events":"https://pith.science/api/pith-number/L7RMCNTS26LXIYQJHHRNVK5CYB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L7RMCNTS26LXIYQJHHRNVK5CYB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L7RMCNTS26LXIYQJHHRNVK5CYB/action/storage_attestation","attest_author":"https://pith.science/pith/L7RMCNTS26LXIYQJHHRNVK5CYB/action/author_attestation","sign_citation":"https://pith.science/pith/L7RMCNTS26LXIYQJHHRNVK5CYB/action/citation_signature","submit_replication":"https://pith.science/pith/L7RMCNTS26LXIYQJHHRNVK5CYB/action/replication_record"}},"created_at":"2026-05-18T00:03:21.121214+00:00","updated_at":"2026-05-18T00:03:21.121214+00:00"}