{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:W2X6DONHMJVZWTRKCATAT4JBKC","short_pith_number":"pith:W2X6DONH","schema_version":"1.0","canonical_sha256":"b6afe1b9a7626b9b4e2a102609f12150aefdfd0d1b9d6dd938f276e2625de18f","source":{"kind":"arxiv","id":"2204.04176","version":2},"attestation_state":"computed","paper":{"title":"Path Defense in Dynamic Defender-Attacker Blotto Games (dDAB) with Limited Information","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.GT","authors_text":"Austin K. Chen, Bryce L. Ferguson, Daigo Shishika, George J. Pappas, Jason R. Marden, Michael Dorothy, Vijay Kumar","submitted_at":"2022-04-08T16:50:29Z","abstract_excerpt":"We consider a path guarding problem in dynamic Defender-Attacker Blotto games (dDAB), where a team of robots must defend a path in a graph against adversarial agents. Multi-robot systems are particularly well suited to this application, as recent work has shown the effectiveness of these systems in related areas such as perimeter defense and surveillance. When designing a defender policy that guarantees the defense of a path, information about the adversary and the environment can be helpful and may reduce the number of resources required by the defender to achieve a sufficient level of securi"},"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":"2204.04176","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2022-04-08T16:50:29Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"999039f3f9b6614179f6571b1df5ebad7a7f82e11d713bad0a79fd0f9f9a815a","abstract_canon_sha256":"aa28fb119c6ba0105286f666690d3a71c38b4f8cb6455940f9041b66246d13d2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:14:03.912757Z","signature_b64":"+d5cud9wx2lUp5m8WUNWpPYge4NvlA+keqd36wMni5q+5rhCurBg72r8arZJDH89v4mVlWi5hTyVc7+nddezCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6afe1b9a7626b9b4e2a102609f12150aefdfd0d1b9d6dd938f276e2625de18f","last_reissued_at":"2026-07-05T06:14:03.912358Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:14:03.912358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Path Defense in Dynamic Defender-Attacker Blotto Games (dDAB) with Limited Information","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.GT","authors_text":"Austin K. Chen, Bryce L. Ferguson, Daigo Shishika, George J. Pappas, Jason R. Marden, Michael Dorothy, Vijay Kumar","submitted_at":"2022-04-08T16:50:29Z","abstract_excerpt":"We consider a path guarding problem in dynamic Defender-Attacker Blotto games (dDAB), where a team of robots must defend a path in a graph against adversarial agents. Multi-robot systems are particularly well suited to this application, as recent work has shown the effectiveness of these systems in related areas such as perimeter defense and surveillance. When designing a defender policy that guarantees the defense of a path, information about the adversary and the environment can be helpful and may reduce the number of resources required by the defender to achieve a sufficient level of securi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.04176","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/2204.04176/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":"2204.04176","created_at":"2026-07-05T06:14:03.912419+00:00"},{"alias_kind":"arxiv_version","alias_value":"2204.04176v2","created_at":"2026-07-05T06:14:03.912419+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.04176","created_at":"2026-07-05T06:14:03.912419+00:00"},{"alias_kind":"pith_short_12","alias_value":"W2X6DONHMJVZ","created_at":"2026-07-05T06:14:03.912419+00:00"},{"alias_kind":"pith_short_16","alias_value":"W2X6DONHMJVZWTRK","created_at":"2026-07-05T06:14:03.912419+00:00"},{"alias_kind":"pith_short_8","alias_value":"W2X6DONH","created_at":"2026-07-05T06:14:03.912419+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/W2X6DONHMJVZWTRKCATAT4JBKC","json":"https://pith.science/pith/W2X6DONHMJVZWTRKCATAT4JBKC.json","graph_json":"https://pith.science/api/pith-number/W2X6DONHMJVZWTRKCATAT4JBKC/graph.json","events_json":"https://pith.science/api/pith-number/W2X6DONHMJVZWTRKCATAT4JBKC/events.json","paper":"https://pith.science/paper/W2X6DONH"},"agent_actions":{"view_html":"https://pith.science/pith/W2X6DONHMJVZWTRKCATAT4JBKC","download_json":"https://pith.science/pith/W2X6DONHMJVZWTRKCATAT4JBKC.json","view_paper":"https://pith.science/paper/W2X6DONH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2204.04176&json=true","fetch_graph":"https://pith.science/api/pith-number/W2X6DONHMJVZWTRKCATAT4JBKC/graph.json","fetch_events":"https://pith.science/api/pith-number/W2X6DONHMJVZWTRKCATAT4JBKC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W2X6DONHMJVZWTRKCATAT4JBKC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W2X6DONHMJVZWTRKCATAT4JBKC/action/storage_attestation","attest_author":"https://pith.science/pith/W2X6DONHMJVZWTRKCATAT4JBKC/action/author_attestation","sign_citation":"https://pith.science/pith/W2X6DONHMJVZWTRKCATAT4JBKC/action/citation_signature","submit_replication":"https://pith.science/pith/W2X6DONHMJVZWTRKCATAT4JBKC/action/replication_record"}},"created_at":"2026-07-05T06:14:03.912419+00:00","updated_at":"2026-07-05T06:14:03.912419+00:00"}