{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:IHHTHPY7TGED5JT4HXM4DZOEFR","short_pith_number":"pith:IHHTHPY7","schema_version":"1.0","canonical_sha256":"41cf33bf1f99883ea67c3dd9c1e5c42c63b662f535ef3d959511511e1de58018","source":{"kind":"arxiv","id":"1908.01859","version":2},"attestation_state":"computed","paper":{"title":"The Uniformed Patroller Game","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Stamatios Katsikas, Steve Alpern","submitted_at":"2019-08-05T21:02:54Z","abstract_excerpt":"In the recently introduced network patrolling game, an Attacker carries out an attack on a node of her choice, for a given number m of consecutive periods. The parameter m indicates the difficulty of the attack at a given node. To thwart such an attack, the Patroller adopts a walk on the network, hoping to be at the attacked node during one of the m periods. If this occurs, the attack is interrupted and the Patroller wins; otherwise the Attacker wins. In the original setting, the Attacker has no knowledge of the Patroller's location at any time. Here, to model the important alternative where t"},"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":"1908.01859","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-05T21:02:54Z","cross_cats_sorted":[],"title_canon_sha256":"3daeedb857eb2a4b2db6af9c60cbb30cbc69c7ed83159574ae6e1a0d44891aea","abstract_canon_sha256":"e22758e92d9a08f0936d653a8574cfae4e9087c9be8be23122660d5ce3447581"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:56:36.144371Z","signature_b64":"rAd04OgtdWMkbWDCXmiAlsBRMl0RNOcF6hN++SXYw2JzrlSyZjURz8OHTivHTATVZjdrQ6CJwu8eeA7TJot9Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41cf33bf1f99883ea67c3dd9c1e5c42c63b662f535ef3d959511511e1de58018","last_reissued_at":"2026-07-04T23:56:36.143906Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:56:36.143906Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Uniformed Patroller Game","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Stamatios Katsikas, Steve Alpern","submitted_at":"2019-08-05T21:02:54Z","abstract_excerpt":"In the recently introduced network patrolling game, an Attacker carries out an attack on a node of her choice, for a given number m of consecutive periods. The parameter m indicates the difficulty of the attack at a given node. To thwart such an attack, the Patroller adopts a walk on the network, hoping to be at the attacked node during one of the m periods. If this occurs, the attack is interrupted and the Patroller wins; otherwise the Attacker wins. In the original setting, the Attacker has no knowledge of the Patroller's location at any time. Here, to model the important alternative where t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.01859","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/1908.01859/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":"1908.01859","created_at":"2026-07-04T23:56:36.143961+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.01859v2","created_at":"2026-07-04T23:56:36.143961+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.01859","created_at":"2026-07-04T23:56:36.143961+00:00"},{"alias_kind":"pith_short_12","alias_value":"IHHTHPY7TGED","created_at":"2026-07-04T23:56:36.143961+00:00"},{"alias_kind":"pith_short_16","alias_value":"IHHTHPY7TGED5JT4","created_at":"2026-07-04T23:56:36.143961+00:00"},{"alias_kind":"pith_short_8","alias_value":"IHHTHPY7","created_at":"2026-07-04T23:56:36.143961+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.07366","citing_title":"The Uniformed Patroller Game","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IHHTHPY7TGED5JT4HXM4DZOEFR","json":"https://pith.science/pith/IHHTHPY7TGED5JT4HXM4DZOEFR.json","graph_json":"https://pith.science/api/pith-number/IHHTHPY7TGED5JT4HXM4DZOEFR/graph.json","events_json":"https://pith.science/api/pith-number/IHHTHPY7TGED5JT4HXM4DZOEFR/events.json","paper":"https://pith.science/paper/IHHTHPY7"},"agent_actions":{"view_html":"https://pith.science/pith/IHHTHPY7TGED5JT4HXM4DZOEFR","download_json":"https://pith.science/pith/IHHTHPY7TGED5JT4HXM4DZOEFR.json","view_paper":"https://pith.science/paper/IHHTHPY7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.01859&json=true","fetch_graph":"https://pith.science/api/pith-number/IHHTHPY7TGED5JT4HXM4DZOEFR/graph.json","fetch_events":"https://pith.science/api/pith-number/IHHTHPY7TGED5JT4HXM4DZOEFR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IHHTHPY7TGED5JT4HXM4DZOEFR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IHHTHPY7TGED5JT4HXM4DZOEFR/action/storage_attestation","attest_author":"https://pith.science/pith/IHHTHPY7TGED5JT4HXM4DZOEFR/action/author_attestation","sign_citation":"https://pith.science/pith/IHHTHPY7TGED5JT4HXM4DZOEFR/action/citation_signature","submit_replication":"https://pith.science/pith/IHHTHPY7TGED5JT4HXM4DZOEFR/action/replication_record"}},"created_at":"2026-07-04T23:56:36.143961+00:00","updated_at":"2026-07-04T23:56:36.143961+00:00"}