{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ONOWA7YKIRMCIXL2RFAWWKSE46","short_pith_number":"pith:ONOWA7YK","schema_version":"1.0","canonical_sha256":"735d607f0a4458245d7a89416b2a44e7abb659fc94e9c267f1c5a6dfa3a94434","source":{"kind":"arxiv","id":"1401.6070","version":1},"attestation_state":"computed","paper":{"title":"On Fence Patrolling by Mobile Agents","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Adrian Dumitrescu, Anirban Ghosh, Csaba D. T\\'oth","submitted_at":"2014-01-23T17:56:52Z","abstract_excerpt":"Suppose that a fence needs to be protected (perpetually) by $k$ mobile agents with maximum speeds $v_1,\\ldots,v_k$ so that no point on the fence is left unattended for more than a given amount of time. The problem is to determine if this requirement can be met, and if so, to design a suitable patrolling schedule for the agents. Alternatively, one would like to find a schedule that minimizes the \\emph{idle time}, that is, the longest time interval during which some point is not visited by any agent. We revisit this problem, introduced by Czyzowicz et al.(2011), and discuss several strategies fo"},"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":"1401.6070","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-23T17:56:52Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"c1c71bf72886044520af516b84e8aa5d40ebe14161ec97bddfb3a7bf197e75cd","abstract_canon_sha256":"31c30d8df32de52bf0ee645acaf3e7867adb3e5c79bcb8060d3b6f182cdfcd63"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:22.538446Z","signature_b64":"Kg+1OIiq/BA8GscGOxb9hVy/Kp52wZ8RSWwFPFg5RWJ3R9jUuJsbtiNv9oyo3W8Drq89o9OjTt5j1AJf3DhtCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"735d607f0a4458245d7a89416b2a44e7abb659fc94e9c267f1c5a6dfa3a94434","last_reissued_at":"2026-05-18T03:01:22.537674Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:22.537674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Fence Patrolling by Mobile Agents","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Adrian Dumitrescu, Anirban Ghosh, Csaba D. T\\'oth","submitted_at":"2014-01-23T17:56:52Z","abstract_excerpt":"Suppose that a fence needs to be protected (perpetually) by $k$ mobile agents with maximum speeds $v_1,\\ldots,v_k$ so that no point on the fence is left unattended for more than a given amount of time. The problem is to determine if this requirement can be met, and if so, to design a suitable patrolling schedule for the agents. Alternatively, one would like to find a schedule that minimizes the \\emph{idle time}, that is, the longest time interval during which some point is not visited by any agent. We revisit this problem, introduced by Czyzowicz et al.(2011), and discuss several strategies fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6070","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":"1401.6070","created_at":"2026-05-18T03:01:22.537790+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.6070v1","created_at":"2026-05-18T03:01:22.537790+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6070","created_at":"2026-05-18T03:01:22.537790+00:00"},{"alias_kind":"pith_short_12","alias_value":"ONOWA7YKIRMC","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"ONOWA7YKIRMCIXL2","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"ONOWA7YK","created_at":"2026-05-18T12:28:41.024544+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/ONOWA7YKIRMCIXL2RFAWWKSE46","json":"https://pith.science/pith/ONOWA7YKIRMCIXL2RFAWWKSE46.json","graph_json":"https://pith.science/api/pith-number/ONOWA7YKIRMCIXL2RFAWWKSE46/graph.json","events_json":"https://pith.science/api/pith-number/ONOWA7YKIRMCIXL2RFAWWKSE46/events.json","paper":"https://pith.science/paper/ONOWA7YK"},"agent_actions":{"view_html":"https://pith.science/pith/ONOWA7YKIRMCIXL2RFAWWKSE46","download_json":"https://pith.science/pith/ONOWA7YKIRMCIXL2RFAWWKSE46.json","view_paper":"https://pith.science/paper/ONOWA7YK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.6070&json=true","fetch_graph":"https://pith.science/api/pith-number/ONOWA7YKIRMCIXL2RFAWWKSE46/graph.json","fetch_events":"https://pith.science/api/pith-number/ONOWA7YKIRMCIXL2RFAWWKSE46/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ONOWA7YKIRMCIXL2RFAWWKSE46/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ONOWA7YKIRMCIXL2RFAWWKSE46/action/storage_attestation","attest_author":"https://pith.science/pith/ONOWA7YKIRMCIXL2RFAWWKSE46/action/author_attestation","sign_citation":"https://pith.science/pith/ONOWA7YKIRMCIXL2RFAWWKSE46/action/citation_signature","submit_replication":"https://pith.science/pith/ONOWA7YKIRMCIXL2RFAWWKSE46/action/replication_record"}},"created_at":"2026-05-18T03:01:22.537790+00:00","updated_at":"2026-05-18T03:01:22.537790+00:00"}