{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:V6WF2VA7QPEHJU75M3WGS326UW","short_pith_number":"pith:V6WF2VA7","schema_version":"1.0","canonical_sha256":"afac5d541f83c874d3fd66ec696f5ea5a06c40a62c3f88f80b678d6d32fd78fe","source":{"kind":"arxiv","id":"2007.02204","version":3},"attestation_state":"computed","paper":{"title":"Failure-Resilient Coverage Maximization with Multiple Robots","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Ishat E Rabban, Pratap Tokekar","submitted_at":"2020-07-04T23:03:38Z","abstract_excerpt":"The task of maximizing coverage using multiple robots has several applications such as surveillance, exploration, and environmental monitoring. A major challenge of deploying such multi-robot systems in a practical scenario is to ensure resilience against robot failures. A recent work introduced the Resilient Coverage Maximization (RCM) problem where the goal is to maximize a submodular coverage utility when the robots are subject to adversarial attacks or failures. The RCM problem is known to be NP-hard. In this paper, we propose two approximation algorithms for the RCM problem, namely, the O"},"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":"2007.02204","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2020-07-04T23:03:38Z","cross_cats_sorted":[],"title_canon_sha256":"88618c2f7342fbfe07f2a7d618219e8cc137e2839523580e5e51cd62796f7159","abstract_canon_sha256":"8dfef9a6586eee759cf43bcd8e242bad3458f7483dad47fbb14a6f3ddcc59939"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:20:14.214626Z","signature_b64":"VKxn5JBy8pSp/cz3WuM/iknrhcJxOHp518u/OxGfrSU5mJNccxUtHT/N1EntPhQnHdieRd7UJPoeu5dc9RzJDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"afac5d541f83c874d3fd66ec696f5ea5a06c40a62c3f88f80b678d6d32fd78fe","last_reissued_at":"2026-07-05T02:20:14.214165Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:20:14.214165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Failure-Resilient Coverage Maximization with Multiple Robots","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Ishat E Rabban, Pratap Tokekar","submitted_at":"2020-07-04T23:03:38Z","abstract_excerpt":"The task of maximizing coverage using multiple robots has several applications such as surveillance, exploration, and environmental monitoring. A major challenge of deploying such multi-robot systems in a practical scenario is to ensure resilience against robot failures. A recent work introduced the Resilient Coverage Maximization (RCM) problem where the goal is to maximize a submodular coverage utility when the robots are subject to adversarial attacks or failures. The RCM problem is known to be NP-hard. In this paper, we propose two approximation algorithms for the RCM problem, namely, the O"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.02204","kind":"arxiv","version":3},"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/2007.02204/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":"2007.02204","created_at":"2026-07-05T02:20:14.214221+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.02204v3","created_at":"2026-07-05T02:20:14.214221+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.02204","created_at":"2026-07-05T02:20:14.214221+00:00"},{"alias_kind":"pith_short_12","alias_value":"V6WF2VA7QPEH","created_at":"2026-07-05T02:20:14.214221+00:00"},{"alias_kind":"pith_short_16","alias_value":"V6WF2VA7QPEHJU75","created_at":"2026-07-05T02:20:14.214221+00:00"},{"alias_kind":"pith_short_8","alias_value":"V6WF2VA7","created_at":"2026-07-05T02:20:14.214221+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.06319","citing_title":"Reinforcement Learning for Game-Theoretic Resource Allocation on Graphs","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/V6WF2VA7QPEHJU75M3WGS326UW","json":"https://pith.science/pith/V6WF2VA7QPEHJU75M3WGS326UW.json","graph_json":"https://pith.science/api/pith-number/V6WF2VA7QPEHJU75M3WGS326UW/graph.json","events_json":"https://pith.science/api/pith-number/V6WF2VA7QPEHJU75M3WGS326UW/events.json","paper":"https://pith.science/paper/V6WF2VA7"},"agent_actions":{"view_html":"https://pith.science/pith/V6WF2VA7QPEHJU75M3WGS326UW","download_json":"https://pith.science/pith/V6WF2VA7QPEHJU75M3WGS326UW.json","view_paper":"https://pith.science/paper/V6WF2VA7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.02204&json=true","fetch_graph":"https://pith.science/api/pith-number/V6WF2VA7QPEHJU75M3WGS326UW/graph.json","fetch_events":"https://pith.science/api/pith-number/V6WF2VA7QPEHJU75M3WGS326UW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V6WF2VA7QPEHJU75M3WGS326UW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V6WF2VA7QPEHJU75M3WGS326UW/action/storage_attestation","attest_author":"https://pith.science/pith/V6WF2VA7QPEHJU75M3WGS326UW/action/author_attestation","sign_citation":"https://pith.science/pith/V6WF2VA7QPEHJU75M3WGS326UW/action/citation_signature","submit_replication":"https://pith.science/pith/V6WF2VA7QPEHJU75M3WGS326UW/action/replication_record"}},"created_at":"2026-07-05T02:20:14.214221+00:00","updated_at":"2026-07-05T02:20:14.214221+00:00"}