{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:U54AB4X745NUMVX7VIP4KL2GCC","short_pith_number":"pith:U54AB4X7","schema_version":"1.0","canonical_sha256":"a77800f2ffe75b4656ffaa1fc52f461081356d828d8060f0c95e6a6d4861dae0","source":{"kind":"arxiv","id":"1507.03407","version":1},"attestation_state":"computed","paper":{"title":"Strategy Synthesis in Adversarial Patrolling Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Anton\\'in Ku\\v{c}era, Mat\\'u\\v{s} Abaffy, Petr Hlin\\v{e}n\\'y, Tom\\'a\\v{s} Br\\'azdil, Vojt\\v{e}ch \\v{R}eh\\'ak","submitted_at":"2015-07-13T11:52:17Z","abstract_excerpt":"Patrolling is one of the central problems in operational security. Formally, a patrolling problem is specified by a set $U$ of nodes (admissible defender's positions), a set $T \\subseteq U$ of vulnerable targets, an admissible defender's moves over $U$, and a function which to every target assigns the time needed to complete an intrusion at it. The goal is to design an optimal strategy for a defender who is moving from node to node and aims at detecting possible intrusions at the targets. The goal of the attacker is to maximize the probability of a successful attack. We assume that the attacke"},"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":"1507.03407","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-07-13T11:52:17Z","cross_cats_sorted":[],"title_canon_sha256":"db9a9bda45e4a2a027327ea8609356e7cf03e0504c7e5c12d2ab69988fee08a4","abstract_canon_sha256":"7ddd101630920c1afca7a161ba747ab2b37b2c445247b94bd8401ff988a3e996"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:46.414765Z","signature_b64":"D6olb2NfhnqgMaMbcjAYEz5w0TKfVVa0PTpMDa0iM7rf7j/whZTq6E6wvl9WdDtPfFTU8YE7SVTC2Yamh10vBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a77800f2ffe75b4656ffaa1fc52f461081356d828d8060f0c95e6a6d4861dae0","last_reissued_at":"2026-05-18T01:09:46.414250Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:46.414250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strategy Synthesis in Adversarial Patrolling Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Anton\\'in Ku\\v{c}era, Mat\\'u\\v{s} Abaffy, Petr Hlin\\v{e}n\\'y, Tom\\'a\\v{s} Br\\'azdil, Vojt\\v{e}ch \\v{R}eh\\'ak","submitted_at":"2015-07-13T11:52:17Z","abstract_excerpt":"Patrolling is one of the central problems in operational security. Formally, a patrolling problem is specified by a set $U$ of nodes (admissible defender's positions), a set $T \\subseteq U$ of vulnerable targets, an admissible defender's moves over $U$, and a function which to every target assigns the time needed to complete an intrusion at it. The goal is to design an optimal strategy for a defender who is moving from node to node and aims at detecting possible intrusions at the targets. The goal of the attacker is to maximize the probability of a successful attack. We assume that the attacke"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.03407","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":"1507.03407","created_at":"2026-05-18T01:09:46.414328+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.03407v1","created_at":"2026-05-18T01:09:46.414328+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.03407","created_at":"2026-05-18T01:09:46.414328+00:00"},{"alias_kind":"pith_short_12","alias_value":"U54AB4X745NU","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"U54AB4X745NUMVX7","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"U54AB4X7","created_at":"2026-05-18T12:29:44.643036+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/U54AB4X745NUMVX7VIP4KL2GCC","json":"https://pith.science/pith/U54AB4X745NUMVX7VIP4KL2GCC.json","graph_json":"https://pith.science/api/pith-number/U54AB4X745NUMVX7VIP4KL2GCC/graph.json","events_json":"https://pith.science/api/pith-number/U54AB4X745NUMVX7VIP4KL2GCC/events.json","paper":"https://pith.science/paper/U54AB4X7"},"agent_actions":{"view_html":"https://pith.science/pith/U54AB4X745NUMVX7VIP4KL2GCC","download_json":"https://pith.science/pith/U54AB4X745NUMVX7VIP4KL2GCC.json","view_paper":"https://pith.science/paper/U54AB4X7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.03407&json=true","fetch_graph":"https://pith.science/api/pith-number/U54AB4X745NUMVX7VIP4KL2GCC/graph.json","fetch_events":"https://pith.science/api/pith-number/U54AB4X745NUMVX7VIP4KL2GCC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U54AB4X745NUMVX7VIP4KL2GCC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U54AB4X745NUMVX7VIP4KL2GCC/action/storage_attestation","attest_author":"https://pith.science/pith/U54AB4X745NUMVX7VIP4KL2GCC/action/author_attestation","sign_citation":"https://pith.science/pith/U54AB4X745NUMVX7VIP4KL2GCC/action/citation_signature","submit_replication":"https://pith.science/pith/U54AB4X745NUMVX7VIP4KL2GCC/action/replication_record"}},"created_at":"2026-05-18T01:09:46.414328+00:00","updated_at":"2026-05-18T01:09:46.414328+00:00"}