{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ULYVVYL6DJXCDZ7MYK6OH55NM7","short_pith_number":"pith:ULYVVYL6","schema_version":"1.0","canonical_sha256":"a2f15ae17e1a6e21e7ecc2bce3f7ad67eaf8fc40452c9b83ec3a5fb121bb2229","source":{"kind":"arxiv","id":"1808.04349","version":1},"attestation_state":"computed","paper":{"title":"Patrolling on Dynamic Ring Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Giuseppe Antonio Di Luna, Leszek A. Gasieniec, Shantanu Das","submitted_at":"2018-08-13T17:52:53Z","abstract_excerpt":"We study the problem of patrolling the nodes of a network collaboratively by a team of mobile agents, such that each node of the network is visited by at least one agent once in every $I(n)$ time units, with the objective of minimizing the idle time $I(n)$. While patrolling has been studied previously for static networks, we investigate the problem on dynamic networks with a fixed set of nodes, but dynamic edges. In particular, we consider 1-interval-connected ring networks and provide various patrolling algorithms for such networks, for $k=2$ or $k>2$ agents. We also show almost matching lowe"},"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":"1808.04349","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-08-13T17:52:53Z","cross_cats_sorted":[],"title_canon_sha256":"0ce2c4afd714db8e524030664da6c1bb682aa3bb58deb25a7eee8d27342aadc6","abstract_canon_sha256":"c07a24fce618d4c5d732db68cfe67be546d899365a36eea9c6d381e49d747f2d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:16.604082Z","signature_b64":"2zcs3w+z75wMVXVAkBcnefV3EfTnihhPJ8HoBcgU5/4tRMc/CwLlxn3tTEcyL1HIvru812a7eX5q95dJ0EXNBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2f15ae17e1a6e21e7ecc2bce3f7ad67eaf8fc40452c9b83ec3a5fb121bb2229","last_reissued_at":"2026-05-18T00:08:16.603568Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:16.603568Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Patrolling on Dynamic Ring Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Giuseppe Antonio Di Luna, Leszek A. Gasieniec, Shantanu Das","submitted_at":"2018-08-13T17:52:53Z","abstract_excerpt":"We study the problem of patrolling the nodes of a network collaboratively by a team of mobile agents, such that each node of the network is visited by at least one agent once in every $I(n)$ time units, with the objective of minimizing the idle time $I(n)$. While patrolling has been studied previously for static networks, we investigate the problem on dynamic networks with a fixed set of nodes, but dynamic edges. In particular, we consider 1-interval-connected ring networks and provide various patrolling algorithms for such networks, for $k=2$ or $k>2$ agents. We also show almost matching lowe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.04349","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":"1808.04349","created_at":"2026-05-18T00:08:16.603636+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.04349v1","created_at":"2026-05-18T00:08:16.603636+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04349","created_at":"2026-05-18T00:08:16.603636+00:00"},{"alias_kind":"pith_short_12","alias_value":"ULYVVYL6DJXC","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"ULYVVYL6DJXCDZ7M","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"ULYVVYL6","created_at":"2026-05-18T12:32:56.356000+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/ULYVVYL6DJXCDZ7MYK6OH55NM7","json":"https://pith.science/pith/ULYVVYL6DJXCDZ7MYK6OH55NM7.json","graph_json":"https://pith.science/api/pith-number/ULYVVYL6DJXCDZ7MYK6OH55NM7/graph.json","events_json":"https://pith.science/api/pith-number/ULYVVYL6DJXCDZ7MYK6OH55NM7/events.json","paper":"https://pith.science/paper/ULYVVYL6"},"agent_actions":{"view_html":"https://pith.science/pith/ULYVVYL6DJXCDZ7MYK6OH55NM7","download_json":"https://pith.science/pith/ULYVVYL6DJXCDZ7MYK6OH55NM7.json","view_paper":"https://pith.science/paper/ULYVVYL6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.04349&json=true","fetch_graph":"https://pith.science/api/pith-number/ULYVVYL6DJXCDZ7MYK6OH55NM7/graph.json","fetch_events":"https://pith.science/api/pith-number/ULYVVYL6DJXCDZ7MYK6OH55NM7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ULYVVYL6DJXCDZ7MYK6OH55NM7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ULYVVYL6DJXCDZ7MYK6OH55NM7/action/storage_attestation","attest_author":"https://pith.science/pith/ULYVVYL6DJXCDZ7MYK6OH55NM7/action/author_attestation","sign_citation":"https://pith.science/pith/ULYVVYL6DJXCDZ7MYK6OH55NM7/action/citation_signature","submit_replication":"https://pith.science/pith/ULYVVYL6DJXCDZ7MYK6OH55NM7/action/replication_record"}},"created_at":"2026-05-18T00:08:16.603636+00:00","updated_at":"2026-05-18T00:08:16.603636+00:00"}