{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:C2CBBWJYGBFXKYRP7XVGBT4WKV","short_pith_number":"pith:C2CBBWJY","schema_version":"1.0","canonical_sha256":"168410d938304b75622ffdea60cf9655463f83e30d2765b5c8746e267e9b3cb5","source":{"kind":"arxiv","id":"2209.07557","version":1},"attestation_state":"computed","paper":{"title":"On Optimal Coverage of a Tree with Multiple Robots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","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","submitted_at":"2022-09-15T18:36:44Z","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"},"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":"2209.07557","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2022-09-15T18:36:44Z","cross_cats_sorted":[],"title_canon_sha256":"3e6cdefae48376173a79c8bdfa3b8172b77f1efc561d41a221c076f5eed2c38b","abstract_canon_sha256":"9d8c98499bc3a2cf27bf7a0e7d66c227c2b8f7ff52fde84f5ed1d43c2a9e76c3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:58:07.183972Z","signature_b64":"x6QXPdfCIubE0W8cOfxK6eP6j3hG52GgvRdhc43haOnzm1xoX8L66nuvOFyCXngSoTRyK9HEFHklZMD/8xNpCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"168410d938304b75622ffdea60cf9655463f83e30d2765b5c8746e267e9b3cb5","last_reissued_at":"2026-07-05T04:58:07.183518Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:58:07.183518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Optimal Coverage of a Tree with Multiple Robots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","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","submitted_at":"2022-09-15T18:36:44Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.07557","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2209.07557/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2209.07557","created_at":"2026-07-05T04:58:07.183577+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.07557v1","created_at":"2026-07-05T04:58:07.183577+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.07557","created_at":"2026-07-05T04:58:07.183577+00:00"},{"alias_kind":"pith_short_12","alias_value":"C2CBBWJYGBFX","created_at":"2026-07-05T04:58:07.183577+00:00"},{"alias_kind":"pith_short_16","alias_value":"C2CBBWJYGBFXKYRP","created_at":"2026-07-05T04:58:07.183577+00:00"},{"alias_kind":"pith_short_8","alias_value":"C2CBBWJY","created_at":"2026-07-05T04:58:07.183577+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/C2CBBWJYGBFXKYRP7XVGBT4WKV","json":"https://pith.science/pith/C2CBBWJYGBFXKYRP7XVGBT4WKV.json","graph_json":"https://pith.science/api/pith-number/C2CBBWJYGBFXKYRP7XVGBT4WKV/graph.json","events_json":"https://pith.science/api/pith-number/C2CBBWJYGBFXKYRP7XVGBT4WKV/events.json","paper":"https://pith.science/paper/C2CBBWJY"},"agent_actions":{"view_html":"https://pith.science/pith/C2CBBWJYGBFXKYRP7XVGBT4WKV","download_json":"https://pith.science/pith/C2CBBWJYGBFXKYRP7XVGBT4WKV.json","view_paper":"https://pith.science/paper/C2CBBWJY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.07557&json=true","fetch_graph":"https://pith.science/api/pith-number/C2CBBWJYGBFXKYRP7XVGBT4WKV/graph.json","fetch_events":"https://pith.science/api/pith-number/C2CBBWJYGBFXKYRP7XVGBT4WKV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C2CBBWJYGBFXKYRP7XVGBT4WKV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C2CBBWJYGBFXKYRP7XVGBT4WKV/action/storage_attestation","attest_author":"https://pith.science/pith/C2CBBWJYGBFXKYRP7XVGBT4WKV/action/author_attestation","sign_citation":"https://pith.science/pith/C2CBBWJYGBFXKYRP7XVGBT4WKV/action/citation_signature","submit_replication":"https://pith.science/pith/C2CBBWJYGBFXKYRP7XVGBT4WKV/action/replication_record"}},"created_at":"2026-07-05T04:58:07.183577+00:00","updated_at":"2026-07-05T04:58:07.183577+00:00"}