{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ULYVVYL6DJXCDZ7MYK6OH55NM7","short_pith_number":"pith:ULYVVYL6","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"},"canonical_sha256":"a2f15ae17e1a6e21e7ecc2bce3f7ad67eaf8fc40452c9b83ec3a5fb121bb2229","source":{"kind":"arxiv","id":"1808.04349","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.04349","created_at":"2026-05-18T00:08:16Z"},{"alias_kind":"arxiv_version","alias_value":"1808.04349v1","created_at":"2026-05-18T00:08:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04349","created_at":"2026-05-18T00:08:16Z"},{"alias_kind":"pith_short_12","alias_value":"ULYVVYL6DJXC","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"ULYVVYL6DJXCDZ7M","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"ULYVVYL6","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ULYVVYL6DJXCDZ7MYK6OH55NM7","target":"record","payload":{"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"},"canonical_sha256":"a2f15ae17e1a6e21e7ecc2bce3f7ad67eaf8fc40452c9b83ec3a5fb121bb2229","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"},"source_kind":"arxiv","source_id":"1808.04349","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-18T00:08:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UN1mvJREIjA22muPkqDihlJdqL81+OnCTbrYXylWeO24W63z6ZeNOZw7DQDHo+vCw8frSaZ6wMB++z3Fpu6YAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:35:24.268234Z"},"content_sha256":"faf156ccb55b97e509591a2b2f545c7e7309c646fb5745d11c4667fcd06b4549","schema_version":"1.0","event_id":"sha256:faf156ccb55b97e509591a2b2f545c7e7309c646fb5745d11c4667fcd06b4549"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ULYVVYL6DJXCDZ7MYK6OH55NM7","target":"graph","payload":{"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"},"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-18T00:08:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cKlpi61DsS0KFSID1K/6LRVqApj5jpl3Wfu+mA3k740+uMQcp4s+JqQkL5fxbbQYhClH2hAuspvsvAuFCMoqCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:35:24.268602Z"},"content_sha256":"bd04ebbdbc1682b858b921f6e3dfc4b0c2af0e42f4eb14c98c903ab8a3820b75","schema_version":"1.0","event_id":"sha256:bd04ebbdbc1682b858b921f6e3dfc4b0c2af0e42f4eb14c98c903ab8a3820b75"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ULYVVYL6DJXCDZ7MYK6OH55NM7/bundle.json","state_url":"https://pith.science/pith/ULYVVYL6DJXCDZ7MYK6OH55NM7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ULYVVYL6DJXCDZ7MYK6OH55NM7/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-06-03T17:35:24Z","links":{"resolver":"https://pith.science/pith/ULYVVYL6DJXCDZ7MYK6OH55NM7","bundle":"https://pith.science/pith/ULYVVYL6DJXCDZ7MYK6OH55NM7/bundle.json","state":"https://pith.science/pith/ULYVVYL6DJXCDZ7MYK6OH55NM7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ULYVVYL6DJXCDZ7MYK6OH55NM7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ULYVVYL6DJXCDZ7MYK6OH55NM7","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":"c07a24fce618d4c5d732db68cfe67be546d899365a36eea9c6d381e49d747f2d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-08-13T17:52:53Z","title_canon_sha256":"0ce2c4afd714db8e524030664da6c1bb682aa3bb58deb25a7eee8d27342aadc6"},"schema_version":"1.0","source":{"id":"1808.04349","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.04349","created_at":"2026-05-18T00:08:16Z"},{"alias_kind":"arxiv_version","alias_value":"1808.04349v1","created_at":"2026-05-18T00:08:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04349","created_at":"2026-05-18T00:08:16Z"},{"alias_kind":"pith_short_12","alias_value":"ULYVVYL6DJXC","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"ULYVVYL6DJXCDZ7M","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"ULYVVYL6","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:bd04ebbdbc1682b858b921f6e3dfc4b0c2af0e42f4eb14c98c903ab8a3820b75","target":"graph","created_at":"2026-05-18T00:08:16Z","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":"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","authors_text":"Giuseppe Antonio Di Luna, Leszek A. Gasieniec, Shantanu Das","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-08-13T17:52:53Z","title":"Patrolling on Dynamic Ring Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.04349","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:faf156ccb55b97e509591a2b2f545c7e7309c646fb5745d11c4667fcd06b4549","target":"record","created_at":"2026-05-18T00:08:16Z","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":"c07a24fce618d4c5d732db68cfe67be546d899365a36eea9c6d381e49d747f2d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-08-13T17:52:53Z","title_canon_sha256":"0ce2c4afd714db8e524030664da6c1bb682aa3bb58deb25a7eee8d27342aadc6"},"schema_version":"1.0","source":{"id":"1808.04349","kind":"arxiv","version":1}},"canonical_sha256":"a2f15ae17e1a6e21e7ecc2bce3f7ad67eaf8fc40452c9b83ec3a5fb121bb2229","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a2f15ae17e1a6e21e7ecc2bce3f7ad67eaf8fc40452c9b83ec3a5fb121bb2229","first_computed_at":"2026-05-18T00:08:16.603568Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:16.603568Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2zcs3w+z75wMVXVAkBcnefV3EfTnihhPJ8HoBcgU5/4tRMc/CwLlxn3tTEcyL1HIvru812a7eX5q95dJ0EXNBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:16.604082Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.04349","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:faf156ccb55b97e509591a2b2f545c7e7309c646fb5745d11c4667fcd06b4549","sha256:bd04ebbdbc1682b858b921f6e3dfc4b0c2af0e42f4eb14c98c903ab8a3820b75"],"state_sha256":"7e5f458e7964a9338bc8617d0565c3051ad881b8b1346976bdcb03de36d1aea8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dU8i8GAu7vlrKb6CuPfzVwVzltPVL4uSIA7cUUTFJtaS/dwww7lTkg2JoNh0v6UAmcwTs7f3CgXzeORB7YUIAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T17:35:24.270581Z","bundle_sha256":"2f69e8e25bc787d5245b7849f1476a73df09e0c69dd1967ba9ea7a403c7253ce"}}