{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:L7RMCNTS26LXIYQJHHRNVK5CYB","short_pith_number":"pith:L7RMCNTS","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"},"canonical_sha256":"5fe2c13672d79774620939e2daaba2c0709ab7fd087672d3e761f3f333bff54b","source":{"kind":"arxiv","id":"1810.06213","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.06213","created_at":"2026-05-18T00:03:21Z"},{"alias_kind":"arxiv_version","alias_value":"1810.06213v1","created_at":"2026-05-18T00:03:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.06213","created_at":"2026-05-18T00:03:21Z"},{"alias_kind":"pith_short_12","alias_value":"L7RMCNTS26LX","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"L7RMCNTS26LXIYQJ","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"L7RMCNTS","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:L7RMCNTS26LXIYQJHHRNVK5CYB","target":"record","payload":{"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"},"canonical_sha256":"5fe2c13672d79774620939e2daaba2c0709ab7fd087672d3e761f3f333bff54b","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"},"source_kind":"arxiv","source_id":"1810.06213","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:03:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zdYLGM0dGDxQKXOuR3H8JxLXums/4uoScKKpYJUVU1HQd91ApTaXuuGhPYmycMNmCZgwe3eJbUdgvVgnLBI7Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:29:58.522284Z"},"content_sha256":"b54fc2561e34e9f8f6d911bc72d3da8afc9851ae4aff1180a49aadb3c2214a0e","schema_version":"1.0","event_id":"sha256:b54fc2561e34e9f8f6d911bc72d3da8afc9851ae4aff1180a49aadb3c2214a0e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:L7RMCNTS26LXIYQJHHRNVK5CYB","target":"graph","payload":{"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"},"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:03:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EREdyOL/sImEkzLFLlz6PTW4WDz6i1p02D+M8NBJH/5OFzl48qu1se4Se/wF54tYeQ29yeIM9xHi17uxxrstDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:29:58.522645Z"},"content_sha256":"a8d8d09a103af42cbdebce47f66ec38df5a8d30a037b14a9c291709950eaf6ef","schema_version":"1.0","event_id":"sha256:a8d8d09a103af42cbdebce47f66ec38df5a8d30a037b14a9c291709950eaf6ef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L7RMCNTS26LXIYQJHHRNVK5CYB/bundle.json","state_url":"https://pith.science/pith/L7RMCNTS26LXIYQJHHRNVK5CYB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L7RMCNTS26LXIYQJHHRNVK5CYB/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-06-01T16:29:58Z","links":{"resolver":"https://pith.science/pith/L7RMCNTS26LXIYQJHHRNVK5CYB","bundle":"https://pith.science/pith/L7RMCNTS26LXIYQJHHRNVK5CYB/bundle.json","state":"https://pith.science/pith/L7RMCNTS26LXIYQJHHRNVK5CYB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L7RMCNTS26LXIYQJHHRNVK5CYB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:L7RMCNTS26LXIYQJHHRNVK5CYB","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":"e69701f57a61e24116f5ce09ff59737db827c28617e89a69c0e1e7c7bd769514","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2018-10-15T08:00:34Z","title_canon_sha256":"70f42514dfd12a866f5fd79154cd77584f3f130e675990e7e894f43b1efdf59e"},"schema_version":"1.0","source":{"id":"1810.06213","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.06213","created_at":"2026-05-18T00:03:21Z"},{"alias_kind":"arxiv_version","alias_value":"1810.06213v1","created_at":"2026-05-18T00:03:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.06213","created_at":"2026-05-18T00:03:21Z"},{"alias_kind":"pith_short_12","alias_value":"L7RMCNTS26LX","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"L7RMCNTS26LXIYQJ","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"L7RMCNTS","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:a8d8d09a103af42cbdebce47f66ec38df5a8d30a037b14a9c291709950eaf6ef","target":"graph","created_at":"2026-05-18T00:03:21Z","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":"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.","authors_text":"Eva Soulier, Fran\\c{c}ois Schwarzentruber, Tristan Charrier","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2018-10-15T08:00:34Z","title":"Dynamic Connected Cooperative Coverage Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.06213","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:b54fc2561e34e9f8f6d911bc72d3da8afc9851ae4aff1180a49aadb3c2214a0e","target":"record","created_at":"2026-05-18T00:03:21Z","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":"e69701f57a61e24116f5ce09ff59737db827c28617e89a69c0e1e7c7bd769514","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2018-10-15T08:00:34Z","title_canon_sha256":"70f42514dfd12a866f5fd79154cd77584f3f130e675990e7e894f43b1efdf59e"},"schema_version":"1.0","source":{"id":"1810.06213","kind":"arxiv","version":1}},"canonical_sha256":"5fe2c13672d79774620939e2daaba2c0709ab7fd087672d3e761f3f333bff54b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5fe2c13672d79774620939e2daaba2c0709ab7fd087672d3e761f3f333bff54b","first_computed_at":"2026-05-18T00:03:21.121157Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:21.121157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VOCaspK7BnhVpCUqGvZn8tMswiEgu0Y5UDRukFPK794j9Wg9UbLKJwjdlrNhLeOlMWDkNlxXMNSbZ2SZHjeOBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:21.121873Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.06213","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b54fc2561e34e9f8f6d911bc72d3da8afc9851ae4aff1180a49aadb3c2214a0e","sha256:a8d8d09a103af42cbdebce47f66ec38df5a8d30a037b14a9c291709950eaf6ef"],"state_sha256":"6ccf78c72e91ae8393aa7230a029b8108a3edbfe23a86b66ba96ec8fbe131596"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/P+AHMMfW3XzBin0GawhTMa5LlYlBp0KpSvXqD6G3ovG4DY+Xw/EVnNZD5uG6DID62dMoXxoE/kC3dR4pFzHAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T16:29:58.524650Z","bundle_sha256":"adfbe1b7a92857b61c065dbff3c0b08031d2f35fb68981f8cd0e5335f82c5592"}}