{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:EFEKCBPEXR5PCD42NNZ67BIHJT","short_pith_number":"pith:EFEKCBPE","canonical_record":{"source":{"id":"1903.06105","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-03-14T16:28:18Z","cross_cats_sorted":[],"title_canon_sha256":"dba9bb5a18f96209ea592605de2790ce2c9ae77dffccf7866055257c2a10572c","abstract_canon_sha256":"99c3e9accc1749581612ba2f85c4aa21a7c354800daba81fd0662267da477c1c"},"schema_version":"1.0"},"canonical_sha256":"2148a105e4bc7af10f9a6b73ef85074ce3181b9e3e7fb02913310f9558167b21","source":{"kind":"arxiv","id":"1903.06105","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.06105","created_at":"2026-05-17T23:51:15Z"},{"alias_kind":"arxiv_version","alias_value":"1903.06105v1","created_at":"2026-05-17T23:51:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.06105","created_at":"2026-05-17T23:51:15Z"},{"alias_kind":"pith_short_12","alias_value":"EFEKCBPEXR5P","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"EFEKCBPEXR5PCD42","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"EFEKCBPE","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:EFEKCBPEXR5PCD42NNZ67BIHJT","target":"record","payload":{"canonical_record":{"source":{"id":"1903.06105","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-03-14T16:28:18Z","cross_cats_sorted":[],"title_canon_sha256":"dba9bb5a18f96209ea592605de2790ce2c9ae77dffccf7866055257c2a10572c","abstract_canon_sha256":"99c3e9accc1749581612ba2f85c4aa21a7c354800daba81fd0662267da477c1c"},"schema_version":"1.0"},"canonical_sha256":"2148a105e4bc7af10f9a6b73ef85074ce3181b9e3e7fb02913310f9558167b21","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:15.368293Z","signature_b64":"u2/yVQTgFju4QZTTyq/nhyRJLzlHR49AvExaln59JydNP48zEriU8XcbPKFUspjV3w96fpbpTHeeKcRjZ7LSBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2148a105e4bc7af10f9a6b73ef85074ce3181b9e3e7fb02913310f9558167b21","last_reissued_at":"2026-05-17T23:51:15.367634Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:15.367634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.06105","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:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zpLDgcOZqJ8iYwhyC1Mdh2mQuI3ykyHkfpFoLvb2IScH0I7gvtqLVv98ECjmRfVg5DaHKSco2vVfqRhTXZPGDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T18:27:31.580031Z"},"content_sha256":"64ec5a9d6fabb139055b6aa8f4a89ef889e50d2c898a5c3dbeb5f3868cb78cbe","schema_version":"1.0","event_id":"sha256:64ec5a9d6fabb139055b6aa8f4a89ef889e50d2c898a5c3dbeb5f3868cb78cbe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:EFEKCBPEXR5PCD42NNZ67BIHJT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-Robot Routing for Persistent Monitoring with Latency Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Ahmad Bilal Asghar, Shreyas Sundaram, Stephen L. Smith","submitted_at":"2019-03-14T16:28:18Z","abstract_excerpt":"In this paper we study a multi-robot path planning problem for persistent monitoring of an environment. We represent the areas to be monitored as the vertices of a weighted graph. For each vertex, there is a constraint on the maximum time spent by the robots between visits to that vertex, called the latency, and the objective is to find the minimum number of robots that can satisfy these latency constraints. The decision version of this problem is known to be PSPACE-complete. We present a $O(\\log \\rho)$ approximation algorithm for the problem where $\\rho$ is the ratio of the maximum and the mi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.06105","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:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IUDaLVXd9njkqp43QSotQQcPfYsWGjVqK5Zw+CIwWM/BS/DjEFxdUdIryyloFC7E4icGGiKnU9Lg7nDozZ3MDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T18:27:31.580394Z"},"content_sha256":"36c9a8751bdc6c638e015ad841ad5af09d74eb4fa7f74dc07cfaf844131e77a7","schema_version":"1.0","event_id":"sha256:36c9a8751bdc6c638e015ad841ad5af09d74eb4fa7f74dc07cfaf844131e77a7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EFEKCBPEXR5PCD42NNZ67BIHJT/bundle.json","state_url":"https://pith.science/pith/EFEKCBPEXR5PCD42NNZ67BIHJT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EFEKCBPEXR5PCD42NNZ67BIHJT/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-02T18:27:31Z","links":{"resolver":"https://pith.science/pith/EFEKCBPEXR5PCD42NNZ67BIHJT","bundle":"https://pith.science/pith/EFEKCBPEXR5PCD42NNZ67BIHJT/bundle.json","state":"https://pith.science/pith/EFEKCBPEXR5PCD42NNZ67BIHJT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EFEKCBPEXR5PCD42NNZ67BIHJT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:EFEKCBPEXR5PCD42NNZ67BIHJT","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":"99c3e9accc1749581612ba2f85c4aa21a7c354800daba81fd0662267da477c1c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-03-14T16:28:18Z","title_canon_sha256":"dba9bb5a18f96209ea592605de2790ce2c9ae77dffccf7866055257c2a10572c"},"schema_version":"1.0","source":{"id":"1903.06105","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.06105","created_at":"2026-05-17T23:51:15Z"},{"alias_kind":"arxiv_version","alias_value":"1903.06105v1","created_at":"2026-05-17T23:51:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.06105","created_at":"2026-05-17T23:51:15Z"},{"alias_kind":"pith_short_12","alias_value":"EFEKCBPEXR5P","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"EFEKCBPEXR5PCD42","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"EFEKCBPE","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:36c9a8751bdc6c638e015ad841ad5af09d74eb4fa7f74dc07cfaf844131e77a7","target":"graph","created_at":"2026-05-17T23:51:15Z","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":"In this paper we study a multi-robot path planning problem for persistent monitoring of an environment. We represent the areas to be monitored as the vertices of a weighted graph. For each vertex, there is a constraint on the maximum time spent by the robots between visits to that vertex, called the latency, and the objective is to find the minimum number of robots that can satisfy these latency constraints. The decision version of this problem is known to be PSPACE-complete. We present a $O(\\log \\rho)$ approximation algorithm for the problem where $\\rho$ is the ratio of the maximum and the mi","authors_text":"Ahmad Bilal Asghar, Shreyas Sundaram, Stephen L. Smith","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-03-14T16:28:18Z","title":"Multi-Robot Routing for Persistent Monitoring with Latency Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.06105","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:64ec5a9d6fabb139055b6aa8f4a89ef889e50d2c898a5c3dbeb5f3868cb78cbe","target":"record","created_at":"2026-05-17T23:51:15Z","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":"99c3e9accc1749581612ba2f85c4aa21a7c354800daba81fd0662267da477c1c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-03-14T16:28:18Z","title_canon_sha256":"dba9bb5a18f96209ea592605de2790ce2c9ae77dffccf7866055257c2a10572c"},"schema_version":"1.0","source":{"id":"1903.06105","kind":"arxiv","version":1}},"canonical_sha256":"2148a105e4bc7af10f9a6b73ef85074ce3181b9e3e7fb02913310f9558167b21","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2148a105e4bc7af10f9a6b73ef85074ce3181b9e3e7fb02913310f9558167b21","first_computed_at":"2026-05-17T23:51:15.367634Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:15.367634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u2/yVQTgFju4QZTTyq/nhyRJLzlHR49AvExaln59JydNP48zEriU8XcbPKFUspjV3w96fpbpTHeeKcRjZ7LSBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:15.368293Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.06105","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:64ec5a9d6fabb139055b6aa8f4a89ef889e50d2c898a5c3dbeb5f3868cb78cbe","sha256:36c9a8751bdc6c638e015ad841ad5af09d74eb4fa7f74dc07cfaf844131e77a7"],"state_sha256":"60425a165b6455bca7d71f035430e022890a09146a2fe7ab69c04d6bcde26976"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hY2QWkNQspPAY7hqfeqWYmX5PnkqCdw0vVTvGoaWKajP26usn5K9SzqIqcCv7EOTT0mNxt5im8+yRZSyNhanBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T18:27:31.582396Z","bundle_sha256":"0d7ac6bad6013f2aba4a3c13d6be5815d5300208527aa8a616b6c48706252d6e"}}