{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:R5AVDE2HSXR4KYL4EHTZUNFNQ3","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":"f6230caef340c15d30015a254b6f83c53a422a5e37e9a332896788f4f7fd6e81","cross_cats_sorted":["cs.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2010-11-08T22:54:55Z","title_canon_sha256":"82d2ed197c60f879aa259ab7a6525e41bd470519bcf7b17a97d867c3600e6619"},"schema_version":"1.0","source":{"id":"1011.1939","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.1939","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"arxiv_version","alias_value":"1011.1939v2","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.1939","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"pith_short_12","alias_value":"R5AVDE2HSXR4","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"R5AVDE2HSXR4KYL4","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"R5AVDE2H","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:894e6f7b712af6e7f48b09c57caf88f52f083b3fb29ce2ca2dd02f2c0b902fb9","target":"graph","created_at":"2026-05-18T00:58:19Z","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 propose distributed algorithms to automatically deploy a team of mobile robots to partition and provide coverage of a non-convex environment. To handle arbitrary non-convex environments, we represent them as graphs. Our partitioning and coverage algorithm requires only short-range, unreliable pairwise \"gossip\" communication. The algorithm has two components: (1) a motion protocol to ensure that neighboring robots communicate at least sporadically, and (2) a pairwise partitioning rule to update territory ownership when two robots communicate. By studying an appropriate dynamical system on th","authors_text":"Francesco Bullo, Joseph W. Durham, Paolo Frasca, Ruggero Carli","cross_cats":["cs.SY","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2010-11-08T22:54:55Z","title":"Discrete Partitioning and Coverage Control for Gossiping Robots"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.1939","kind":"arxiv","version":2},"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:1b238809e690390f90b75c6e55c02fe7d3ed967b1dd64f229a4d36cc7abd962c","target":"record","created_at":"2026-05-18T00:58:19Z","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":"f6230caef340c15d30015a254b6f83c53a422a5e37e9a332896788f4f7fd6e81","cross_cats_sorted":["cs.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2010-11-08T22:54:55Z","title_canon_sha256":"82d2ed197c60f879aa259ab7a6525e41bd470519bcf7b17a97d867c3600e6619"},"schema_version":"1.0","source":{"id":"1011.1939","kind":"arxiv","version":2}},"canonical_sha256":"8f4151934795e3c5617c21e79a34ad86c41517deffa28ca58fb2fa648ec641a8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8f4151934795e3c5617c21e79a34ad86c41517deffa28ca58fb2fa648ec641a8","first_computed_at":"2026-05-18T00:58:19.325128Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:19.325128Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RSBJgmpdynuOcPW7BJR/AIqBxqyHGv3UmqZjI+aI9mfFJkzmxQC1lCxtSan35ImTlKDfAljWec1PQQ7Dz9odDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:19.325800Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.1939","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1b238809e690390f90b75c6e55c02fe7d3ed967b1dd64f229a4d36cc7abd962c","sha256:894e6f7b712af6e7f48b09c57caf88f52f083b3fb29ce2ca2dd02f2c0b902fb9"],"state_sha256":"2a387a7bed5870a564cbf7efea3d16c4ff24e12eaf91e918f5cda494fdb42e9c"}