{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:6LOR6AVQJDIAA3XKIRNEYUZE5F","short_pith_number":"pith:6LOR6AVQ","schema_version":"1.0","canonical_sha256":"f2dd1f02b048d0006eea445a4c5324e95d6370e2180ab3d23aff0f0e39f11a38","source":{"kind":"arxiv","id":"1705.10399","version":1},"attestation_state":"computed","paper":{"title":"Periodic Patrols on the Line and Other Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Katerina Papadaki, Steve Alpern, Thomas Lidbetter","submitted_at":"2017-05-29T21:16:09Z","abstract_excerpt":"We consider a patrolling game on a graph recently introduced by Alpern et al. (2011) where the Patroller wins if he is at the attacked node while the attack is taking place. This paper studies the periodic patrolling game in the case that the attack duration is two periods. We show that if the Patroller's period is even, the game can be solved on any graph by finding the fractional covering number and fractional independence number of the graph. We also give a complete solution to the periodic patrolling game on line graphs of arbitrary size, extending the work of Papadaki et al. (2016) to the"},"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":"1705.10399","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-29T21:16:09Z","cross_cats_sorted":[],"title_canon_sha256":"c533308e3b2e1b93b065f21e2e27a0f052aab820a3873f69d049eff210a42e1e","abstract_canon_sha256":"7327c3c0877cc9a4a2d5ff1edf25204d4af57ed05f1131d482c52cd2815365a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:31.155436Z","signature_b64":"Bh8quxDk0/RygRLMZakqFb9a0LIkoA0EVJLHoD2cbjRyFZVBqIFvES0uaVR8Yq4/wFidNX1W/hb4HgZh1TJPDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2dd1f02b048d0006eea445a4c5324e95d6370e2180ab3d23aff0f0e39f11a38","last_reissued_at":"2026-05-18T00:43:31.154908Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:31.154908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Periodic Patrols on the Line and Other Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Katerina Papadaki, Steve Alpern, Thomas Lidbetter","submitted_at":"2017-05-29T21:16:09Z","abstract_excerpt":"We consider a patrolling game on a graph recently introduced by Alpern et al. (2011) where the Patroller wins if he is at the attacked node while the attack is taking place. This paper studies the periodic patrolling game in the case that the attack duration is two periods. We show that if the Patroller's period is even, the game can be solved on any graph by finding the fractional covering number and fractional independence number of the graph. We also give a complete solution to the periodic patrolling game on line graphs of arbitrary size, extending the work of Papadaki et al. (2016) to the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10399","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":"1705.10399","created_at":"2026-05-18T00:43:31.154967+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.10399v1","created_at":"2026-05-18T00:43:31.154967+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10399","created_at":"2026-05-18T00:43:31.154967+00:00"},{"alias_kind":"pith_short_12","alias_value":"6LOR6AVQJDIA","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"6LOR6AVQJDIAA3XK","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"6LOR6AVQ","created_at":"2026-05-18T12:31:03.183658+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/6LOR6AVQJDIAA3XKIRNEYUZE5F","json":"https://pith.science/pith/6LOR6AVQJDIAA3XKIRNEYUZE5F.json","graph_json":"https://pith.science/api/pith-number/6LOR6AVQJDIAA3XKIRNEYUZE5F/graph.json","events_json":"https://pith.science/api/pith-number/6LOR6AVQJDIAA3XKIRNEYUZE5F/events.json","paper":"https://pith.science/paper/6LOR6AVQ"},"agent_actions":{"view_html":"https://pith.science/pith/6LOR6AVQJDIAA3XKIRNEYUZE5F","download_json":"https://pith.science/pith/6LOR6AVQJDIAA3XKIRNEYUZE5F.json","view_paper":"https://pith.science/paper/6LOR6AVQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.10399&json=true","fetch_graph":"https://pith.science/api/pith-number/6LOR6AVQJDIAA3XKIRNEYUZE5F/graph.json","fetch_events":"https://pith.science/api/pith-number/6LOR6AVQJDIAA3XKIRNEYUZE5F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6LOR6AVQJDIAA3XKIRNEYUZE5F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6LOR6AVQJDIAA3XKIRNEYUZE5F/action/storage_attestation","attest_author":"https://pith.science/pith/6LOR6AVQJDIAA3XKIRNEYUZE5F/action/author_attestation","sign_citation":"https://pith.science/pith/6LOR6AVQJDIAA3XKIRNEYUZE5F/action/citation_signature","submit_replication":"https://pith.science/pith/6LOR6AVQJDIAA3XKIRNEYUZE5F/action/replication_record"}},"created_at":"2026-05-18T00:43:31.154967+00:00","updated_at":"2026-05-18T00:43:31.154967+00:00"}