{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:TW5PURZIU7KJE6Z5V6B7MPAJUN","short_pith_number":"pith:TW5PURZI","schema_version":"1.0","canonical_sha256":"9dbafa4728a7d4927b3daf83f63c09a361a4211ab98c9a0c5f559b8c59f4643b","source":{"kind":"arxiv","id":"1401.2960","version":2},"attestation_state":"computed","paper":{"title":"A Leapfrog Strategy for Pursuit-Evasion in a Polygonal Environment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Andrew Beveridge, Brendan Ames, Claire Djang, Maxray Savage, Rosalie Carlson, Stephen Ragain, Volkan Isler","submitted_at":"2014-01-13T19:34:19Z","abstract_excerpt":"We study pursuit-evasion in a polygonal environment with polygonal obstacles. In this turn based game, an evader $e$ is chased by pursuers $p_1, p_2, ..., p_{\\ell}$. The players have full information about the environment and the location of the other players. The pursuers are allowed to coordinate their actions. On the pursuer turn, each $p_i$ can move to any point at distance at most 1 from his current location. On the evader turn, he moves similarly. The pursuers win if some pursuer becomes co-located with the evader in finite time. The evader wins if he can evade capture forever.\n  It is k"},"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":"1401.2960","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-01-13T19:34:19Z","cross_cats_sorted":[],"title_canon_sha256":"48133b06d8d461ef515a6a9c49090bc1dee7f60f946506a597cb48ef41258619","abstract_canon_sha256":"3109a4e9fcb89ac5884256e73b1b60512a8fb431cbe267b4d4294dac55319d71"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:48.489672Z","signature_b64":"+FqcETiczod3I0KJgiCUCEUjF2dHEkDb+Fro8iRnG20wY2/1L7WQQPB4i3h0rWOL6B4L5Fnmgz4U15dXtkv5Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9dbafa4728a7d4927b3daf83f63c09a361a4211ab98c9a0c5f559b8c59f4643b","last_reissued_at":"2026-05-18T02:39:48.489214Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:48.489214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Leapfrog Strategy for Pursuit-Evasion in a Polygonal Environment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Andrew Beveridge, Brendan Ames, Claire Djang, Maxray Savage, Rosalie Carlson, Stephen Ragain, Volkan Isler","submitted_at":"2014-01-13T19:34:19Z","abstract_excerpt":"We study pursuit-evasion in a polygonal environment with polygonal obstacles. In this turn based game, an evader $e$ is chased by pursuers $p_1, p_2, ..., p_{\\ell}$. The players have full information about the environment and the location of the other players. The pursuers are allowed to coordinate their actions. On the pursuer turn, each $p_i$ can move to any point at distance at most 1 from his current location. On the evader turn, he moves similarly. The pursuers win if some pursuer becomes co-located with the evader in finite time. The evader wins if he can evade capture forever.\n  It is k"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.2960","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":""},"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":"1401.2960","created_at":"2026-05-18T02:39:48.489283+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.2960v2","created_at":"2026-05-18T02:39:48.489283+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2960","created_at":"2026-05-18T02:39:48.489283+00:00"},{"alias_kind":"pith_short_12","alias_value":"TW5PURZIU7KJ","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"TW5PURZIU7KJE6Z5","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"TW5PURZI","created_at":"2026-05-18T12:28:52.271510+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/TW5PURZIU7KJE6Z5V6B7MPAJUN","json":"https://pith.science/pith/TW5PURZIU7KJE6Z5V6B7MPAJUN.json","graph_json":"https://pith.science/api/pith-number/TW5PURZIU7KJE6Z5V6B7MPAJUN/graph.json","events_json":"https://pith.science/api/pith-number/TW5PURZIU7KJE6Z5V6B7MPAJUN/events.json","paper":"https://pith.science/paper/TW5PURZI"},"agent_actions":{"view_html":"https://pith.science/pith/TW5PURZIU7KJE6Z5V6B7MPAJUN","download_json":"https://pith.science/pith/TW5PURZIU7KJE6Z5V6B7MPAJUN.json","view_paper":"https://pith.science/paper/TW5PURZI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.2960&json=true","fetch_graph":"https://pith.science/api/pith-number/TW5PURZIU7KJE6Z5V6B7MPAJUN/graph.json","fetch_events":"https://pith.science/api/pith-number/TW5PURZIU7KJE6Z5V6B7MPAJUN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TW5PURZIU7KJE6Z5V6B7MPAJUN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TW5PURZIU7KJE6Z5V6B7MPAJUN/action/storage_attestation","attest_author":"https://pith.science/pith/TW5PURZIU7KJE6Z5V6B7MPAJUN/action/author_attestation","sign_citation":"https://pith.science/pith/TW5PURZIU7KJE6Z5V6B7MPAJUN/action/citation_signature","submit_replication":"https://pith.science/pith/TW5PURZIU7KJE6Z5V6B7MPAJUN/action/replication_record"}},"created_at":"2026-05-18T02:39:48.489283+00:00","updated_at":"2026-05-18T02:39:48.489283+00:00"}