{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:SEFBDHZ5HV3YZECPLJ57PFJYZB","short_pith_number":"pith:SEFBDHZ5","schema_version":"1.0","canonical_sha256":"910a119f3d3d778c904f5a7bf79538c8632b30b75a11adf6a177f73491b65608","source":{"kind":"arxiv","id":"2409.11311","version":2},"attestation_state":"computed","paper":{"title":"Constrained Learning for Decentralized Multi-Objective Coverage Control","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Alejandro Ribeiro, Juan Cervino, Saurav Agarwal, Vijay Kumar","submitted_at":"2024-09-17T16:11:07Z","abstract_excerpt":"The multi-objective coverage control problem requires a robot swarm to collaboratively provide sensor coverage to multiple heterogeneous importance density fields IDFs simultaneously. We pose this as an optimization problem with constraints and study two different formulations: (1) Fair coverage, where we minimize the maximum coverage cost for any field, promoting equitable resource distribution among all fields; and (2) Constrained coverage, where each field must be covered below a certain cost threshold, ensuring that critical areas receive adequate coverage according to predefined importanc"},"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":"2409.11311","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SY","submitted_at":"2024-09-17T16:11:07Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"92ad950f6246c41450022eb04f670bce9de91ebf9d3aa9b67a9ce77d329b09de","abstract_canon_sha256":"b163afa65e093b81ac69527db1aca7fd7304315da071e4467f362c69337585d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:30:23.005276Z","signature_b64":"9qgLZ5s9O2OBdb2KRT8mib9Rmi500Ha5qsUeDYYTR++oXCN7+Cf4STPgicXv+jPerDKET5nELo2ucs9w2M0zAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"910a119f3d3d778c904f5a7bf79538c8632b30b75a11adf6a177f73491b65608","last_reissued_at":"2026-07-05T10:30:23.004779Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:30:23.004779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constrained Learning for Decentralized Multi-Objective Coverage Control","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Alejandro Ribeiro, Juan Cervino, Saurav Agarwal, Vijay Kumar","submitted_at":"2024-09-17T16:11:07Z","abstract_excerpt":"The multi-objective coverage control problem requires a robot swarm to collaboratively provide sensor coverage to multiple heterogeneous importance density fields IDFs simultaneously. We pose this as an optimization problem with constraints and study two different formulations: (1) Fair coverage, where we minimize the maximum coverage cost for any field, promoting equitable resource distribution among all fields; and (2) Constrained coverage, where each field must be covered below a certain cost threshold, ensuring that critical areas receive adequate coverage according to predefined importanc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.11311","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2409.11311/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2409.11311","created_at":"2026-07-05T10:30:23.004829+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.11311v2","created_at":"2026-07-05T10:30:23.004829+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.11311","created_at":"2026-07-05T10:30:23.004829+00:00"},{"alias_kind":"pith_short_12","alias_value":"SEFBDHZ5HV3Y","created_at":"2026-07-05T10:30:23.004829+00:00"},{"alias_kind":"pith_short_16","alias_value":"SEFBDHZ5HV3YZECP","created_at":"2026-07-05T10:30:23.004829+00:00"},{"alias_kind":"pith_short_8","alias_value":"SEFBDHZ5","created_at":"2026-07-05T10:30:23.004829+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/SEFBDHZ5HV3YZECPLJ57PFJYZB","json":"https://pith.science/pith/SEFBDHZ5HV3YZECPLJ57PFJYZB.json","graph_json":"https://pith.science/api/pith-number/SEFBDHZ5HV3YZECPLJ57PFJYZB/graph.json","events_json":"https://pith.science/api/pith-number/SEFBDHZ5HV3YZECPLJ57PFJYZB/events.json","paper":"https://pith.science/paper/SEFBDHZ5"},"agent_actions":{"view_html":"https://pith.science/pith/SEFBDHZ5HV3YZECPLJ57PFJYZB","download_json":"https://pith.science/pith/SEFBDHZ5HV3YZECPLJ57PFJYZB.json","view_paper":"https://pith.science/paper/SEFBDHZ5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.11311&json=true","fetch_graph":"https://pith.science/api/pith-number/SEFBDHZ5HV3YZECPLJ57PFJYZB/graph.json","fetch_events":"https://pith.science/api/pith-number/SEFBDHZ5HV3YZECPLJ57PFJYZB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SEFBDHZ5HV3YZECPLJ57PFJYZB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SEFBDHZ5HV3YZECPLJ57PFJYZB/action/storage_attestation","attest_author":"https://pith.science/pith/SEFBDHZ5HV3YZECPLJ57PFJYZB/action/author_attestation","sign_citation":"https://pith.science/pith/SEFBDHZ5HV3YZECPLJ57PFJYZB/action/citation_signature","submit_replication":"https://pith.science/pith/SEFBDHZ5HV3YZECPLJ57PFJYZB/action/replication_record"}},"created_at":"2026-07-05T10:30:23.004829+00:00","updated_at":"2026-07-05T10:30:23.004829+00:00"}