{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:Z2FWFT2E2LJRMLFDWVDADO3IGQ","short_pith_number":"pith:Z2FWFT2E","schema_version":"1.0","canonical_sha256":"ce8b62cf44d2d3162ca3b54601bb683400e66e3778dea6ab1a1b801ad3380bc6","source":{"kind":"arxiv","id":"2606.10201","version":1},"attestation_state":"computed","paper":{"title":"Game-Theoretic Area Coverage Control with Cooperative-Adversarial Multi-Agent Systems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Davide Spinello, Mohammad Pirani, Ruiming Zheng","submitted_at":"2026-06-08T21:43:39Z","abstract_excerpt":"We formulate a multi-agent area coverage control problem as a two-player zero-sum game between two agent groups with conflicting goals. Conventional coverage control allocates resources based on an environmental risk density field. In contrast, we generalize this metric by allowing a second group of adversarial agents to generate the spatial risk field. Coupled agent dynamics are linked through the area coverage metric, which functions as the game reward. This framework induces coupled gradient-descent-ascent controllers for the groups. Analysis of a low-dimensional case reveals a Hopf bifurca"},"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":"2606.10201","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SY","submitted_at":"2026-06-08T21:43:39Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"bb88a6457059b4b356820c9e2e54d56ed0215bdc97433fe34e0f45de932e28f2","abstract_canon_sha256":"cdf074c160f5628a8dcb7d5aee0fa6d06eabe517ef0cea48a0a1c318875b3309"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-10T01:08:59.327015Z","signature_b64":"nThaOqMXL98Se9CPA+PxJsh6H4+TfmKxnvCorHlvN6lU4n59Cec51z++cTMuWsh+CyuuNktguWDA+S6FuG92AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce8b62cf44d2d3162ca3b54601bb683400e66e3778dea6ab1a1b801ad3380bc6","last_reissued_at":"2026-06-10T01:08:59.326053Z","signature_status":"signed_v1","first_computed_at":"2026-06-10T01:08:59.326053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Game-Theoretic Area Coverage Control with Cooperative-Adversarial Multi-Agent Systems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Davide Spinello, Mohammad Pirani, Ruiming Zheng","submitted_at":"2026-06-08T21:43:39Z","abstract_excerpt":"We formulate a multi-agent area coverage control problem as a two-player zero-sum game between two agent groups with conflicting goals. Conventional coverage control allocates resources based on an environmental risk density field. In contrast, we generalize this metric by allowing a second group of adversarial agents to generate the spatial risk field. Coupled agent dynamics are linked through the area coverage metric, which functions as the game reward. This framework induces coupled gradient-descent-ascent controllers for the groups. Analysis of a low-dimensional case reveals a Hopf bifurca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.10201","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.10201/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":"2606.10201","created_at":"2026-06-10T01:08:59.326229+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.10201v1","created_at":"2026-06-10T01:08:59.326229+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.10201","created_at":"2026-06-10T01:08:59.326229+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z2FWFT2E2LJR","created_at":"2026-06-10T01:08:59.326229+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z2FWFT2E2LJRMLFD","created_at":"2026-06-10T01:08:59.326229+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z2FWFT2E","created_at":"2026-06-10T01:08:59.326229+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/Z2FWFT2E2LJRMLFDWVDADO3IGQ","json":"https://pith.science/pith/Z2FWFT2E2LJRMLFDWVDADO3IGQ.json","graph_json":"https://pith.science/api/pith-number/Z2FWFT2E2LJRMLFDWVDADO3IGQ/graph.json","events_json":"https://pith.science/api/pith-number/Z2FWFT2E2LJRMLFDWVDADO3IGQ/events.json","paper":"https://pith.science/paper/Z2FWFT2E"},"agent_actions":{"view_html":"https://pith.science/pith/Z2FWFT2E2LJRMLFDWVDADO3IGQ","download_json":"https://pith.science/pith/Z2FWFT2E2LJRMLFDWVDADO3IGQ.json","view_paper":"https://pith.science/paper/Z2FWFT2E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.10201&json=true","fetch_graph":"https://pith.science/api/pith-number/Z2FWFT2E2LJRMLFDWVDADO3IGQ/graph.json","fetch_events":"https://pith.science/api/pith-number/Z2FWFT2E2LJRMLFDWVDADO3IGQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z2FWFT2E2LJRMLFDWVDADO3IGQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z2FWFT2E2LJRMLFDWVDADO3IGQ/action/storage_attestation","attest_author":"https://pith.science/pith/Z2FWFT2E2LJRMLFDWVDADO3IGQ/action/author_attestation","sign_citation":"https://pith.science/pith/Z2FWFT2E2LJRMLFDWVDADO3IGQ/action/citation_signature","submit_replication":"https://pith.science/pith/Z2FWFT2E2LJRMLFDWVDADO3IGQ/action/replication_record"}},"created_at":"2026-06-10T01:08:59.326229+00:00","updated_at":"2026-06-10T01:08:59.326229+00:00"}