{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:5FDKCNLWJMD3LF6AKBGUU35D7Q","short_pith_number":"pith:5FDKCNLW","schema_version":"1.0","canonical_sha256":"e946a135764b07b597c0504d4a6fa3fc3c1367d54c13fda054842565654116e6","source":{"kind":"arxiv","id":"1011.0520","version":2},"attestation_state":"computed","paper":{"title":"Adaptive Algorithms for Coverage Control and Space Partitioning in Mobile Robotic Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"math.OC","authors_text":"George J. Pappas, Jerome Le Ny","submitted_at":"2010-11-02T06:42:01Z","abstract_excerpt":"This paper considers deployment problems where a mobile robotic network must optimize its configuration in a distributed way in order to minimize a steady-state cost function that depends on the spatial distribution of certain probabilistic events of interest. Moreover, it is assumed that the event location distribution is a priori unknown, and can only be progressively inferred from the observation of the actual event occurrences. Three classes of problems are discussed in detail: coverage control problems, spatial partitioning problems, and dynamic vehicle routing problems. In each case, dis"},"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.0520","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-11-02T06:42:01Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"0153c87b9f655ab69ddb8a9f9e795759d3b8266edb91448dda0953ccf563d136","abstract_canon_sha256":"afe9aed3961a736b347c29eec8a55f7258230f78f5aca40d456b0dd26063fdff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:48:35.696039Z","signature_b64":"0VYNHte2Vy39P6N2eV1ehuucT5uUvyCeFlixT1LP7ZqOpXr2Wyp8fN/y6aF7Q0peQnpkayO3wCKiA3N6F3LIDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e946a135764b07b597c0504d4a6fa3fc3c1367d54c13fda054842565654116e6","last_reissued_at":"2026-05-18T03:48:35.695564Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:48:35.695564Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Algorithms for Coverage Control and Space Partitioning in Mobile Robotic Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"math.OC","authors_text":"George J. Pappas, Jerome Le Ny","submitted_at":"2010-11-02T06:42:01Z","abstract_excerpt":"This paper considers deployment problems where a mobile robotic network must optimize its configuration in a distributed way in order to minimize a steady-state cost function that depends on the spatial distribution of certain probabilistic events of interest. Moreover, it is assumed that the event location distribution is a priori unknown, and can only be progressively inferred from the observation of the actual event occurrences. Three classes of problems are discussed in detail: coverage control problems, spatial partitioning problems, and dynamic vehicle routing problems. In each case, dis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.0520","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.0520","created_at":"2026-05-18T03:48:35.695630+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.0520v2","created_at":"2026-05-18T03:48:35.695630+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.0520","created_at":"2026-05-18T03:48:35.695630+00:00"},{"alias_kind":"pith_short_12","alias_value":"5FDKCNLWJMD3","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_16","alias_value":"5FDKCNLWJMD3LF6A","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_8","alias_value":"5FDKCNLW","created_at":"2026-05-18T12:26:04.259169+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/5FDKCNLWJMD3LF6AKBGUU35D7Q","json":"https://pith.science/pith/5FDKCNLWJMD3LF6AKBGUU35D7Q.json","graph_json":"https://pith.science/api/pith-number/5FDKCNLWJMD3LF6AKBGUU35D7Q/graph.json","events_json":"https://pith.science/api/pith-number/5FDKCNLWJMD3LF6AKBGUU35D7Q/events.json","paper":"https://pith.science/paper/5FDKCNLW"},"agent_actions":{"view_html":"https://pith.science/pith/5FDKCNLWJMD3LF6AKBGUU35D7Q","download_json":"https://pith.science/pith/5FDKCNLWJMD3LF6AKBGUU35D7Q.json","view_paper":"https://pith.science/paper/5FDKCNLW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.0520&json=true","fetch_graph":"https://pith.science/api/pith-number/5FDKCNLWJMD3LF6AKBGUU35D7Q/graph.json","fetch_events":"https://pith.science/api/pith-number/5FDKCNLWJMD3LF6AKBGUU35D7Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5FDKCNLWJMD3LF6AKBGUU35D7Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5FDKCNLWJMD3LF6AKBGUU35D7Q/action/storage_attestation","attest_author":"https://pith.science/pith/5FDKCNLWJMD3LF6AKBGUU35D7Q/action/author_attestation","sign_citation":"https://pith.science/pith/5FDKCNLWJMD3LF6AKBGUU35D7Q/action/citation_signature","submit_replication":"https://pith.science/pith/5FDKCNLWJMD3LF6AKBGUU35D7Q/action/replication_record"}},"created_at":"2026-05-18T03:48:35.695630+00:00","updated_at":"2026-05-18T03:48:35.695630+00:00"}