{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:C2CBBWJYGBFXKYRP7XVGBT4WKV","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":"9d8c98499bc3a2cf27bf7a0e7d66c227c2b8f7ff52fde84f5ed1d43c2a9e76c3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2022-09-15T18:36:44Z","title_canon_sha256":"3e6cdefae48376173a79c8bdfa3b8172b77f1efc561d41a221c076f5eed2c38b"},"schema_version":"1.0","source":{"id":"2209.07557","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2209.07557","created_at":"2026-07-05T04:58:07Z"},{"alias_kind":"arxiv_version","alias_value":"2209.07557v1","created_at":"2026-07-05T04:58:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.07557","created_at":"2026-07-05T04:58:07Z"},{"alias_kind":"pith_short_12","alias_value":"C2CBBWJYGBFX","created_at":"2026-07-05T04:58:07Z"},{"alias_kind":"pith_short_16","alias_value":"C2CBBWJYGBFXKYRP","created_at":"2026-07-05T04:58:07Z"},{"alias_kind":"pith_short_8","alias_value":"C2CBBWJY","created_at":"2026-07-05T04:58:07Z"}],"graph_snapshots":[{"event_id":"sha256:f94eca18fe87df8808397e54b74c845bf7d7f367ac63f86b76226c263b39534f","target":"graph","created_at":"2026-07-05T04:58:07Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2209.07557/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the algorithmic problem of optimally covering a tree with $k$ mobile robots. The tree is known to all robots, and our goal is to assign a walk to each robot in such a way that the union of these walks covers the whole tree. We assume that the edges have the same length, and that traveling along an edge takes a unit of time. Two objective functions are considered: the cover time and the cover length. The cover time is the maximum time a robot needs to finish its assigned walk and the cover length is the sum of the lengths of all the walks. We also consider a variant in which the robots","authors_text":"A. Ram\\'irez-Vigueras, F. Duque, I. Aldana-Galv\\'an, J.C. Catana-Salazar, J.M. D\\'iaz-B\\'a\\~nez, J. Urrutia, M.A. Heredia, R. Fabila-Monroy","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2022-09-15T18:36:44Z","title":"On Optimal Coverage of a Tree with Multiple Robots"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.07557","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:e10264ae28def36e638e754d1a7cdc62295a2cde7201ddc92d9203cdaa8ec847","target":"record","created_at":"2026-07-05T04:58:07Z","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":"9d8c98499bc3a2cf27bf7a0e7d66c227c2b8f7ff52fde84f5ed1d43c2a9e76c3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2022-09-15T18:36:44Z","title_canon_sha256":"3e6cdefae48376173a79c8bdfa3b8172b77f1efc561d41a221c076f5eed2c38b"},"schema_version":"1.0","source":{"id":"2209.07557","kind":"arxiv","version":1}},"canonical_sha256":"168410d938304b75622ffdea60cf9655463f83e30d2765b5c8746e267e9b3cb5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"168410d938304b75622ffdea60cf9655463f83e30d2765b5c8746e267e9b3cb5","first_computed_at":"2026-07-05T04:58:07.183518Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:58:07.183518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x6QXPdfCIubE0W8cOfxK6eP6j3hG52GgvRdhc43haOnzm1xoX8L66nuvOFyCXngSoTRyK9HEFHklZMD/8xNpCw==","signature_status":"signed_v1","signed_at":"2026-07-05T04:58:07.183972Z","signed_message":"canonical_sha256_bytes"},"source_id":"2209.07557","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e10264ae28def36e638e754d1a7cdc62295a2cde7201ddc92d9203cdaa8ec847","sha256:f94eca18fe87df8808397e54b74c845bf7d7f367ac63f86b76226c263b39534f"],"state_sha256":"ae20f6e81d7c779cdca8c54bec51113dad076199aa5bf5eee6d15e36c7eb5298"}