{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ONOWA7YKIRMCIXL2RFAWWKSE46","short_pith_number":"pith:ONOWA7YK","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"},"canonical_sha256":"735d607f0a4458245d7a89416b2a44e7abb659fc94e9c267f1c5a6dfa3a94434","source":{"kind":"arxiv","id":"1401.6070","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.6070","created_at":"2026-05-18T03:01:22Z"},{"alias_kind":"arxiv_version","alias_value":"1401.6070v1","created_at":"2026-05-18T03:01:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6070","created_at":"2026-05-18T03:01:22Z"},{"alias_kind":"pith_short_12","alias_value":"ONOWA7YKIRMC","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"ONOWA7YKIRMCIXL2","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"ONOWA7YK","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ONOWA7YKIRMCIXL2RFAWWKSE46","target":"record","payload":{"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"},"canonical_sha256":"735d607f0a4458245d7a89416b2a44e7abb659fc94e9c267f1c5a6dfa3a94434","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"},"source_kind":"arxiv","source_id":"1401.6070","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:01:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QCzi8fdfGSJiN+aAI8mieBmr8/kWytH4xRNarndO2hjTu24s3XW5nRXNwLpTwqidyS/j4ouxB/HjX3Ofq1kODA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:16:08.457800Z"},"content_sha256":"133834d2b4ff4f6710801a3379b6d2f9c4fbe05fcdea76300d0414e70664896e","schema_version":"1.0","event_id":"sha256:133834d2b4ff4f6710801a3379b6d2f9c4fbe05fcdea76300d0414e70664896e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ONOWA7YKIRMCIXL2RFAWWKSE46","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:01:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J8oekaVTL9Aq5GKv7JAg8E9tvNPwFcG2aYHIpZ/I3yxDiou4b4QwrRS5NKlE7YrRq3eMQYQhg3jyzn9UsvnRDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:16:08.458616Z"},"content_sha256":"83b9ba65610eaade2ad84ff4afe37d6ac7ca3a0d89c09307ca3315395e9d964a","schema_version":"1.0","event_id":"sha256:83b9ba65610eaade2ad84ff4afe37d6ac7ca3a0d89c09307ca3315395e9d964a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ONOWA7YKIRMCIXL2RFAWWKSE46/bundle.json","state_url":"https://pith.science/pith/ONOWA7YKIRMCIXL2RFAWWKSE46/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ONOWA7YKIRMCIXL2RFAWWKSE46/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T10:16:08Z","links":{"resolver":"https://pith.science/pith/ONOWA7YKIRMCIXL2RFAWWKSE46","bundle":"https://pith.science/pith/ONOWA7YKIRMCIXL2RFAWWKSE46/bundle.json","state":"https://pith.science/pith/ONOWA7YKIRMCIXL2RFAWWKSE46/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ONOWA7YKIRMCIXL2RFAWWKSE46/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ONOWA7YKIRMCIXL2RFAWWKSE46","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":"31c30d8df32de52bf0ee645acaf3e7867adb3e5c79bcb8060d3b6f182cdfcd63","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-23T17:56:52Z","title_canon_sha256":"c1c71bf72886044520af516b84e8aa5d40ebe14161ec97bddfb3a7bf197e75cd"},"schema_version":"1.0","source":{"id":"1401.6070","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.6070","created_at":"2026-05-18T03:01:22Z"},{"alias_kind":"arxiv_version","alias_value":"1401.6070v1","created_at":"2026-05-18T03:01:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6070","created_at":"2026-05-18T03:01:22Z"},{"alias_kind":"pith_short_12","alias_value":"ONOWA7YKIRMC","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"ONOWA7YKIRMCIXL2","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"ONOWA7YK","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:83b9ba65610eaade2ad84ff4afe37d6ac7ca3a0d89c09307ca3315395e9d964a","target":"graph","created_at":"2026-05-18T03:01:22Z","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"},"paper":{"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","authors_text":"Adrian Dumitrescu, Anirban Ghosh, Csaba D. T\\'oth","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-23T17:56:52Z","title":"On Fence Patrolling by Mobile Agents"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6070","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:133834d2b4ff4f6710801a3379b6d2f9c4fbe05fcdea76300d0414e70664896e","target":"record","created_at":"2026-05-18T03:01:22Z","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":"31c30d8df32de52bf0ee645acaf3e7867adb3e5c79bcb8060d3b6f182cdfcd63","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-23T17:56:52Z","title_canon_sha256":"c1c71bf72886044520af516b84e8aa5d40ebe14161ec97bddfb3a7bf197e75cd"},"schema_version":"1.0","source":{"id":"1401.6070","kind":"arxiv","version":1}},"canonical_sha256":"735d607f0a4458245d7a89416b2a44e7abb659fc94e9c267f1c5a6dfa3a94434","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"735d607f0a4458245d7a89416b2a44e7abb659fc94e9c267f1c5a6dfa3a94434","first_computed_at":"2026-05-18T03:01:22.537674Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:01:22.537674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Kg+1OIiq/BA8GscGOxb9hVy/Kp52wZ8RSWwFPFg5RWJ3R9jUuJsbtiNv9oyo3W8Drq89o9OjTt5j1AJf3DhtCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:01:22.538446Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.6070","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:133834d2b4ff4f6710801a3379b6d2f9c4fbe05fcdea76300d0414e70664896e","sha256:83b9ba65610eaade2ad84ff4afe37d6ac7ca3a0d89c09307ca3315395e9d964a"],"state_sha256":"ef3afbf6209dc3bd4f91ff1ccb51fb052a7b7adcf3d45355a9554ac12356e7a2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ARDs/DmfJN7lA/+n9DkLe/tvxjcmj9Ju/KPs49Ycc6uXsZiPAEUG8GkYP0KxsQPg2v/LQdFIpPC+ihIK7Q3pDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T10:16:08.462760Z","bundle_sha256":"62e6be5c32af98d5e20b3336235b7f46cf62caac26e35473560938659fe39d09"}}