{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:KV26SSK5UGE6E673LCFMXGAY4J","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":"a8dc30769d2c45e7a30670da955f70c5026d1d3a426ee40ae506957663996f28","cross_cats_sorted":["cs.DS","cs.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-01-20T17:25:43Z","title_canon_sha256":"7a357033a0f58c5ce8fd7cad0c3ef60c54ff6363bb8feac24c646ee6b016df6c"},"schema_version":"1.0","source":{"id":"1101.3973","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.3973","created_at":"2026-05-18T02:22:50Z"},{"alias_kind":"arxiv_version","alias_value":"1101.3973v3","created_at":"2026-05-18T02:22:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.3973","created_at":"2026-05-18T02:22:50Z"},{"alias_kind":"pith_short_12","alias_value":"KV26SSK5UGE6","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"KV26SSK5UGE6E673","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"KV26SSK5","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:14a5e63f6f87867160315b3419e5da8a1e413932ce0c318e955e9bce79e5d399","target":"graph","created_at":"2026-05-18T02:22:50Z","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":"The subject of this work is the patrolling of an environment with the aid of a team of autonomous agents. We consider both the design of open-loop trajectories with optimal properties, and of distributed control laws converging to optimal trajectories. As performance criteria, the refresh time and the latency are considered, i.e., respectively, time gap between any two visits of the same region, and the time necessary to inform every agent about an event occurred in the environment. We associate a graph with the environment, and we study separately the case of a chain, tree, and cyclic graph. ","authors_text":"Antonio Franchi, Fabio Pasqualetti, Francesco Bullo","cross_cats":["cs.DS","cs.SY","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-01-20T17:25:43Z","title":"On cooperative patrolling: optimal trajectories, complexity analysis, and approximation algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.3973","kind":"arxiv","version":3},"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:dc0ed81c8daccdf25d3efbfd7ad63f60a55f0f4d7fdf5891c87e34ec39e59fae","target":"record","created_at":"2026-05-18T02:22:50Z","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":"a8dc30769d2c45e7a30670da955f70c5026d1d3a426ee40ae506957663996f28","cross_cats_sorted":["cs.DS","cs.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-01-20T17:25:43Z","title_canon_sha256":"7a357033a0f58c5ce8fd7cad0c3ef60c54ff6363bb8feac24c646ee6b016df6c"},"schema_version":"1.0","source":{"id":"1101.3973","kind":"arxiv","version":3}},"canonical_sha256":"5575e9495da189e27bfb588acb9818e24b7e55b65565551f18258215fe271267","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5575e9495da189e27bfb588acb9818e24b7e55b65565551f18258215fe271267","first_computed_at":"2026-05-18T02:22:50.921291Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:50.921291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s2ndEM1N0tk6zW+IiKsM0d6JYivr18T6GJCZHlDh4r7kG+Fko+VffZvbuBgkGARGRCkMVlfT1RerNQBC0n+SAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:50.921686Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.3973","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dc0ed81c8daccdf25d3efbfd7ad63f60a55f0f4d7fdf5891c87e34ec39e59fae","sha256:14a5e63f6f87867160315b3419e5da8a1e413932ce0c318e955e9bce79e5d399"],"state_sha256":"51ae1b42448b498ec4d9f334430689a765efcf3c4803b6be607757f104a181c1"}