{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:STANTTTIA4BFTTKO7NIBEYY43I","short_pith_number":"pith:STANTTTI","schema_version":"1.0","canonical_sha256":"94c0d9ce68070259cd4efb5012631cda04e07b08ef6dfc81d2d74cfb4f628ca7","source":{"kind":"arxiv","id":"1710.00466","version":1},"attestation_state":"computed","paper":{"title":"Patrolling a Path Connecting a Set of Points with Unbalanced Frequencies of Visits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Evangelos Kranakis, Huda Chuangpishit, Jurek Czyzowicz, Konstantinos Georgiou, Leszek Gasieniec, Tomasz Jurdzinski","submitted_at":"2017-10-02T03:04:21Z","abstract_excerpt":"Patrolling consists of scheduling perpetual movements of a collection of mobile robots, so that each point of the environment is regularly revisited by any robot in the collection. In previous research, it was assumed that all points of the environment needed to be revisited with the same minimal frequency. In this paper we study efficient patrolling protocols for points located on a path, where each point may have a different constraint on frequency of visits. The problem of visiting such divergent points was recently posed by Gasieniec et al. in [13], where the authors study protocols using "},"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":"1710.00466","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-10-02T03:04:21Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"4385df6fdfc0b2cbc5b8875b62f1fd3691ec9958eedc53e3c93b156180b4671f","abstract_canon_sha256":"785d88869685574f635d565e3444bfe44b2e490c4b50cc880610bd7dc540e502"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:54.674286Z","signature_b64":"3NXHfnEiXpvXLRRtFZ9FVlCXeJtAU+p5zg8NXxI9pE/OfaaGpw9L0A65ILiiTiKNi/4p6trLAGJxeuwSHyZKDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94c0d9ce68070259cd4efb5012631cda04e07b08ef6dfc81d2d74cfb4f628ca7","last_reissued_at":"2026-05-18T00:33:54.673749Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:54.673749Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Patrolling a Path Connecting a Set of Points with Unbalanced Frequencies of Visits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Evangelos Kranakis, Huda Chuangpishit, Jurek Czyzowicz, Konstantinos Georgiou, Leszek Gasieniec, Tomasz Jurdzinski","submitted_at":"2017-10-02T03:04:21Z","abstract_excerpt":"Patrolling consists of scheduling perpetual movements of a collection of mobile robots, so that each point of the environment is regularly revisited by any robot in the collection. In previous research, it was assumed that all points of the environment needed to be revisited with the same minimal frequency. In this paper we study efficient patrolling protocols for points located on a path, where each point may have a different constraint on frequency of visits. The problem of visiting such divergent points was recently posed by Gasieniec et al. in [13], where the authors study protocols using "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.00466","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":"1710.00466","created_at":"2026-05-18T00:33:54.673830+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.00466v1","created_at":"2026-05-18T00:33:54.673830+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.00466","created_at":"2026-05-18T00:33:54.673830+00:00"},{"alias_kind":"pith_short_12","alias_value":"STANTTTIA4BF","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"STANTTTIA4BFTTKO","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"STANTTTI","created_at":"2026-05-18T12:31:43.269735+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/STANTTTIA4BFTTKO7NIBEYY43I","json":"https://pith.science/pith/STANTTTIA4BFTTKO7NIBEYY43I.json","graph_json":"https://pith.science/api/pith-number/STANTTTIA4BFTTKO7NIBEYY43I/graph.json","events_json":"https://pith.science/api/pith-number/STANTTTIA4BFTTKO7NIBEYY43I/events.json","paper":"https://pith.science/paper/STANTTTI"},"agent_actions":{"view_html":"https://pith.science/pith/STANTTTIA4BFTTKO7NIBEYY43I","download_json":"https://pith.science/pith/STANTTTIA4BFTTKO7NIBEYY43I.json","view_paper":"https://pith.science/paper/STANTTTI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.00466&json=true","fetch_graph":"https://pith.science/api/pith-number/STANTTTIA4BFTTKO7NIBEYY43I/graph.json","fetch_events":"https://pith.science/api/pith-number/STANTTTIA4BFTTKO7NIBEYY43I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/STANTTTIA4BFTTKO7NIBEYY43I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/STANTTTIA4BFTTKO7NIBEYY43I/action/storage_attestation","attest_author":"https://pith.science/pith/STANTTTIA4BFTTKO7NIBEYY43I/action/author_attestation","sign_citation":"https://pith.science/pith/STANTTTIA4BFTTKO7NIBEYY43I/action/citation_signature","submit_replication":"https://pith.science/pith/STANTTTIA4BFTTKO7NIBEYY43I/action/replication_record"}},"created_at":"2026-05-18T00:33:54.673830+00:00","updated_at":"2026-05-18T00:33:54.673830+00:00"}