{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:R5AVDE2HSXR4KYL4EHTZUNFNQ3","short_pith_number":"pith:R5AVDE2H","schema_version":"1.0","canonical_sha256":"8f4151934795e3c5617c21e79a34ad86c41517deffa28ca58fb2fa648ec641a8","source":{"kind":"arxiv","id":"1011.1939","version":2},"attestation_state":"computed","paper":{"title":"Discrete Partitioning and Coverage Control for Gossiping Robots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.OC"],"primary_cat":"cs.RO","authors_text":"Francesco Bullo, Joseph W. Durham, Paolo Frasca, Ruggero Carli","submitted_at":"2010-11-08T22:54:55Z","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"},"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":"1011.1939","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2010-11-08T22:54:55Z","cross_cats_sorted":["cs.SY","math.OC"],"title_canon_sha256":"82d2ed197c60f879aa259ab7a6525e41bd470519bcf7b17a97d867c3600e6619","abstract_canon_sha256":"f6230caef340c15d30015a254b6f83c53a422a5e37e9a332896788f4f7fd6e81"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:19.325800Z","signature_b64":"RSBJgmpdynuOcPW7BJR/AIqBxqyHGv3UmqZjI+aI9mfFJkzmxQC1lCxtSan35ImTlKDfAljWec1PQQ7Dz9odDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f4151934795e3c5617c21e79a34ad86c41517deffa28ca58fb2fa648ec641a8","last_reissued_at":"2026-05-18T00:58:19.325128Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:19.325128Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Discrete Partitioning and Coverage Control for Gossiping Robots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.OC"],"primary_cat":"cs.RO","authors_text":"Francesco Bullo, Joseph W. Durham, Paolo Frasca, Ruggero Carli","submitted_at":"2010-11-08T22:54:55Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.1939","kind":"arxiv","version":2},"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":"1011.1939","created_at":"2026-05-18T00:58:19.325220+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.1939v2","created_at":"2026-05-18T00:58:19.325220+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.1939","created_at":"2026-05-18T00:58:19.325220+00:00"},{"alias_kind":"pith_short_12","alias_value":"R5AVDE2HSXR4","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_16","alias_value":"R5AVDE2HSXR4KYL4","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_8","alias_value":"R5AVDE2H","created_at":"2026-05-18T12:26:13.927090+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/R5AVDE2HSXR4KYL4EHTZUNFNQ3","json":"https://pith.science/pith/R5AVDE2HSXR4KYL4EHTZUNFNQ3.json","graph_json":"https://pith.science/api/pith-number/R5AVDE2HSXR4KYL4EHTZUNFNQ3/graph.json","events_json":"https://pith.science/api/pith-number/R5AVDE2HSXR4KYL4EHTZUNFNQ3/events.json","paper":"https://pith.science/paper/R5AVDE2H"},"agent_actions":{"view_html":"https://pith.science/pith/R5AVDE2HSXR4KYL4EHTZUNFNQ3","download_json":"https://pith.science/pith/R5AVDE2HSXR4KYL4EHTZUNFNQ3.json","view_paper":"https://pith.science/paper/R5AVDE2H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.1939&json=true","fetch_graph":"https://pith.science/api/pith-number/R5AVDE2HSXR4KYL4EHTZUNFNQ3/graph.json","fetch_events":"https://pith.science/api/pith-number/R5AVDE2HSXR4KYL4EHTZUNFNQ3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R5AVDE2HSXR4KYL4EHTZUNFNQ3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R5AVDE2HSXR4KYL4EHTZUNFNQ3/action/storage_attestation","attest_author":"https://pith.science/pith/R5AVDE2HSXR4KYL4EHTZUNFNQ3/action/author_attestation","sign_citation":"https://pith.science/pith/R5AVDE2HSXR4KYL4EHTZUNFNQ3/action/citation_signature","submit_replication":"https://pith.science/pith/R5AVDE2HSXR4KYL4EHTZUNFNQ3/action/replication_record"}},"created_at":"2026-05-18T00:58:19.325220+00:00","updated_at":"2026-05-18T00:58:19.325220+00:00"}