{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:DP4THRT72ERJVCLXZLRYAM35OO","short_pith_number":"pith:DP4THRT7","schema_version":"1.0","canonical_sha256":"1bf933c67fd1229a8977cae380337d73998dc2bdc93af99fffe4a6599031fd14","source":{"kind":"arxiv","id":"1806.07111","version":1},"attestation_state":"computed","paper":{"title":"Facing Multiple Attacks in Adversarial Patrolling Games with Alarmed Targets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.AI","authors_text":"Giuseppe De Nittis, Nicola Gatti","submitted_at":"2018-06-19T08:57:03Z","abstract_excerpt":"We focus on adversarial patrolling games on arbitrary graphs, where the Defender can control a mobile resource, the targets are alarmed by an alarm system, and the Attacker can observe the actions of the mobile resource of the Defender and perform different attacks exploiting multiple resources. This scenario can be modeled as a zero-sum extensive-form game in which each player can play multiple times. The game tree is exponentially large both in the size of the graph and in the number of attacking resources. We show that when the number of the Attacker's resources is free, the problem of comp"},"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":"1806.07111","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-06-19T08:57:03Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"000608c00b957fe271010b2cb9efa735fdb1b828a461a4cb46e4f7a888447f81","abstract_canon_sha256":"45d61593c6c8891118a46b783b157de488dcb7cdc9f22c1f87a0ebd2afac0931"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:51.832784Z","signature_b64":"NvR+WrQVQKndjEtjkXsczueZ5P75JTdHQqylM8CKtn1pV2LCo/CoBh1r9jSJAu2P2a1H3PC4k7c4XNT/KJMMDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1bf933c67fd1229a8977cae380337d73998dc2bdc93af99fffe4a6599031fd14","last_reissued_at":"2026-05-18T00:12:51.832328Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:51.832328Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Facing Multiple Attacks in Adversarial Patrolling Games with Alarmed Targets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.AI","authors_text":"Giuseppe De Nittis, Nicola Gatti","submitted_at":"2018-06-19T08:57:03Z","abstract_excerpt":"We focus on adversarial patrolling games on arbitrary graphs, where the Defender can control a mobile resource, the targets are alarmed by an alarm system, and the Attacker can observe the actions of the mobile resource of the Defender and perform different attacks exploiting multiple resources. This scenario can be modeled as a zero-sum extensive-form game in which each player can play multiple times. The game tree is exponentially large both in the size of the graph and in the number of attacking resources. We show that when the number of the Attacker's resources is free, the problem of comp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.07111","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":""},"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":"1806.07111","created_at":"2026-05-18T00:12:51.832396+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.07111v1","created_at":"2026-05-18T00:12:51.832396+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.07111","created_at":"2026-05-18T00:12:51.832396+00:00"},{"alias_kind":"pith_short_12","alias_value":"DP4THRT72ERJ","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"DP4THRT72ERJVCLX","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"DP4THRT7","created_at":"2026-05-18T12:32:19.392346+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/DP4THRT72ERJVCLXZLRYAM35OO","json":"https://pith.science/pith/DP4THRT72ERJVCLXZLRYAM35OO.json","graph_json":"https://pith.science/api/pith-number/DP4THRT72ERJVCLXZLRYAM35OO/graph.json","events_json":"https://pith.science/api/pith-number/DP4THRT72ERJVCLXZLRYAM35OO/events.json","paper":"https://pith.science/paper/DP4THRT7"},"agent_actions":{"view_html":"https://pith.science/pith/DP4THRT72ERJVCLXZLRYAM35OO","download_json":"https://pith.science/pith/DP4THRT72ERJVCLXZLRYAM35OO.json","view_paper":"https://pith.science/paper/DP4THRT7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.07111&json=true","fetch_graph":"https://pith.science/api/pith-number/DP4THRT72ERJVCLXZLRYAM35OO/graph.json","fetch_events":"https://pith.science/api/pith-number/DP4THRT72ERJVCLXZLRYAM35OO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DP4THRT72ERJVCLXZLRYAM35OO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DP4THRT72ERJVCLXZLRYAM35OO/action/storage_attestation","attest_author":"https://pith.science/pith/DP4THRT72ERJVCLXZLRYAM35OO/action/author_attestation","sign_citation":"https://pith.science/pith/DP4THRT72ERJVCLXZLRYAM35OO/action/citation_signature","submit_replication":"https://pith.science/pith/DP4THRT72ERJVCLXZLRYAM35OO/action/replication_record"}},"created_at":"2026-05-18T00:12:51.832396+00:00","updated_at":"2026-05-18T00:12:51.832396+00:00"}