{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:J6V7O4RYTDWCUXERLLH33CSQOH","short_pith_number":"pith:J6V7O4RY","schema_version":"1.0","canonical_sha256":"4fabf7723898ec2a5c915acfbd8a5071e2aaf73b5d649098e4aa33308105e286","source":{"kind":"arxiv","id":"1606.06271","version":2},"attestation_state":"computed","paper":{"title":"Dynamic Programming for One-Sided Partially Observable Pursuit-Evasion Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Branislav Bo\\v{s}ansk\\'y, Karel Hor\\'ak","submitted_at":"2016-06-20T19:49:46Z","abstract_excerpt":"Pursuit-evasion scenarios appear widely in robotics, security domains, and many other real-world situations. We focus on two-player pursuit-evasion games with concurrent moves, infinite horizon, and discounted rewards. We assume that the players have a partial observability, however, the evader is given an advantage of knowing the current position of the units of the pursuer. This setting is particularly interesting for security domains where a robust strategy, designed to maximize the utility in the worst-case scenario, is often desirable. We provide, to the best of our knowledge, the first a"},"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":"1606.06271","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-06-20T19:49:46Z","cross_cats_sorted":[],"title_canon_sha256":"05a855da405109a07f4f195638f27d4674188b3367ff1fac40e939787c0bd70e","abstract_canon_sha256":"c018e217645eebf22ae07dcca8222c5d036a0665c8394bfa9577695e8523644f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:54.677450Z","signature_b64":"8JBq03EBnVQCKjyBOwB+zBlve2vXpySULoZw2Vj44OxGV41MvTTlpBzwr4DuHpejq98qO79qW9zytENDQ7XWDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4fabf7723898ec2a5c915acfbd8a5071e2aaf73b5d649098e4aa33308105e286","last_reissued_at":"2026-05-18T01:09:54.676755Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:54.676755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic Programming for One-Sided Partially Observable Pursuit-Evasion Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Branislav Bo\\v{s}ansk\\'y, Karel Hor\\'ak","submitted_at":"2016-06-20T19:49:46Z","abstract_excerpt":"Pursuit-evasion scenarios appear widely in robotics, security domains, and many other real-world situations. We focus on two-player pursuit-evasion games with concurrent moves, infinite horizon, and discounted rewards. We assume that the players have a partial observability, however, the evader is given an advantage of knowing the current position of the units of the pursuer. This setting is particularly interesting for security domains where a robust strategy, designed to maximize the utility in the worst-case scenario, is often desirable. We provide, to the best of our knowledge, the first a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.06271","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":"1606.06271","created_at":"2026-05-18T01:09:54.676855+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.06271v2","created_at":"2026-05-18T01:09:54.676855+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.06271","created_at":"2026-05-18T01:09:54.676855+00:00"},{"alias_kind":"pith_short_12","alias_value":"J6V7O4RYTDWC","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"J6V7O4RYTDWCUXER","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"J6V7O4RY","created_at":"2026-05-18T12:30:22.444734+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/J6V7O4RYTDWCUXERLLH33CSQOH","json":"https://pith.science/pith/J6V7O4RYTDWCUXERLLH33CSQOH.json","graph_json":"https://pith.science/api/pith-number/J6V7O4RYTDWCUXERLLH33CSQOH/graph.json","events_json":"https://pith.science/api/pith-number/J6V7O4RYTDWCUXERLLH33CSQOH/events.json","paper":"https://pith.science/paper/J6V7O4RY"},"agent_actions":{"view_html":"https://pith.science/pith/J6V7O4RYTDWCUXERLLH33CSQOH","download_json":"https://pith.science/pith/J6V7O4RYTDWCUXERLLH33CSQOH.json","view_paper":"https://pith.science/paper/J6V7O4RY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.06271&json=true","fetch_graph":"https://pith.science/api/pith-number/J6V7O4RYTDWCUXERLLH33CSQOH/graph.json","fetch_events":"https://pith.science/api/pith-number/J6V7O4RYTDWCUXERLLH33CSQOH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J6V7O4RYTDWCUXERLLH33CSQOH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J6V7O4RYTDWCUXERLLH33CSQOH/action/storage_attestation","attest_author":"https://pith.science/pith/J6V7O4RYTDWCUXERLLH33CSQOH/action/author_attestation","sign_citation":"https://pith.science/pith/J6V7O4RYTDWCUXERLLH33CSQOH/action/citation_signature","submit_replication":"https://pith.science/pith/J6V7O4RYTDWCUXERLLH33CSQOH/action/replication_record"}},"created_at":"2026-05-18T01:09:54.676855+00:00","updated_at":"2026-05-18T01:09:54.676855+00:00"}