{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:VAS3KPFJQLZQJ7JTGXGK6HOO7C","short_pith_number":"pith:VAS3KPFJ","schema_version":"1.0","canonical_sha256":"a825b53ca982f304fd3335ccaf1dcef883d28588daa05d6ddbbd99fad5a0345f","source":{"kind":"arxiv","id":"1008.4941","version":1},"attestation_state":"computed","paper":{"title":"Pairwise Optimal Discrete Coverage Control for Gossiping Robots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.RO","authors_text":"Francesco Bullo, Joseph W. Durham, Ruggero Carli","submitted_at":"2010-08-29T17:22:48Z","abstract_excerpt":"We propose distributed algorithms to automatically deploy a group of robotic agents and provide coverage of a discretized environment represented by a graph. The classic Lloyd approach to coverage optimization involves separate centering and partitioning steps and converges to the set of centroidal Voronoi partitions. In this work we present a novel graph coverage algorithm which achieves better performance without this separation while requiring only pairwise ``gossip'' communication between agents. Our new algorithm provably converges to an element of the set of pairwise-optimal partitions, "},"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":"1008.4941","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2010-08-29T17:22:48Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"e93c5bd4b7c5209a8583bd3290fce427e8fe07d0312a584e676004aee79defad","abstract_canon_sha256":"83fb7be330c9adfd6d587f2bb24e9967bc1d2a5089107eaf346b3dd17ea37251"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:36:10.313588Z","signature_b64":"aAMf/ZYKt0UsP8hXyzm+tPOX0Ofl+wWWgqdyH2oHzjaGHbBZO5AbYnCR6RuGdoUTfJBRg9ZpWJv42ptOnQGbDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a825b53ca982f304fd3335ccaf1dcef883d28588daa05d6ddbbd99fad5a0345f","last_reissued_at":"2026-05-18T04:36:10.312933Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:36:10.312933Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pairwise Optimal Discrete Coverage Control for Gossiping Robots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.RO","authors_text":"Francesco Bullo, Joseph W. Durham, Ruggero Carli","submitted_at":"2010-08-29T17:22:48Z","abstract_excerpt":"We propose distributed algorithms to automatically deploy a group of robotic agents and provide coverage of a discretized environment represented by a graph. The classic Lloyd approach to coverage optimization involves separate centering and partitioning steps and converges to the set of centroidal Voronoi partitions. In this work we present a novel graph coverage algorithm which achieves better performance without this separation while requiring only pairwise ``gossip'' communication between agents. Our new algorithm provably converges to an element of the set of pairwise-optimal partitions, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.4941","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":"1008.4941","created_at":"2026-05-18T04:36:10.313023+00:00"},{"alias_kind":"arxiv_version","alias_value":"1008.4941v1","created_at":"2026-05-18T04:36:10.313023+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.4941","created_at":"2026-05-18T04:36:10.313023+00:00"},{"alias_kind":"pith_short_12","alias_value":"VAS3KPFJQLZQ","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_16","alias_value":"VAS3KPFJQLZQJ7JT","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_8","alias_value":"VAS3KPFJ","created_at":"2026-05-18T12:26:15.391820+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/VAS3KPFJQLZQJ7JTGXGK6HOO7C","json":"https://pith.science/pith/VAS3KPFJQLZQJ7JTGXGK6HOO7C.json","graph_json":"https://pith.science/api/pith-number/VAS3KPFJQLZQJ7JTGXGK6HOO7C/graph.json","events_json":"https://pith.science/api/pith-number/VAS3KPFJQLZQJ7JTGXGK6HOO7C/events.json","paper":"https://pith.science/paper/VAS3KPFJ"},"agent_actions":{"view_html":"https://pith.science/pith/VAS3KPFJQLZQJ7JTGXGK6HOO7C","download_json":"https://pith.science/pith/VAS3KPFJQLZQJ7JTGXGK6HOO7C.json","view_paper":"https://pith.science/paper/VAS3KPFJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1008.4941&json=true","fetch_graph":"https://pith.science/api/pith-number/VAS3KPFJQLZQJ7JTGXGK6HOO7C/graph.json","fetch_events":"https://pith.science/api/pith-number/VAS3KPFJQLZQJ7JTGXGK6HOO7C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VAS3KPFJQLZQJ7JTGXGK6HOO7C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VAS3KPFJQLZQJ7JTGXGK6HOO7C/action/storage_attestation","attest_author":"https://pith.science/pith/VAS3KPFJQLZQJ7JTGXGK6HOO7C/action/author_attestation","sign_citation":"https://pith.science/pith/VAS3KPFJQLZQJ7JTGXGK6HOO7C/action/citation_signature","submit_replication":"https://pith.science/pith/VAS3KPFJQLZQJ7JTGXGK6HOO7C/action/replication_record"}},"created_at":"2026-05-18T04:36:10.313023+00:00","updated_at":"2026-05-18T04:36:10.313023+00:00"}