{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:P7NOY7KE4TUUPLMAEOHN7OC5HI","short_pith_number":"pith:P7NOY7KE","schema_version":"1.0","canonical_sha256":"7fdaec7d44e4e947ad80238edfb85d3a295dfad0114027435e4bdcc6d8a17673","source":{"kind":"arxiv","id":"2401.01149","version":2},"attestation_state":"computed","paper":{"title":"Search Games with Predictions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.GT","authors_text":"Konstantinos Panagiotou, Spyros Angelopoulos, Thomas Lidbetter","submitted_at":"2024-01-02T10:59:29Z","abstract_excerpt":"We introduce the study of search games between a mobile Searcher and an immobile Hider in a new setting in which the Searcher has some potentially erroneous information, i.e., a prediction on the Hider's position. The objective is to establish tight tradeoffs between the consistency of a search strategy (i.e., its worst case expected payoff assuming the prediction is correct) and its robustness (i.e., the worst case expected payoff with no assumptions on the quality of the prediction). Our study is the first to address the full power of mixed (randomized) strategies; previous work focused only"},"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":"2401.01149","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2024-01-02T10:59:29Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"c61cb2926cb0a229029bd3030f3241e3b0f6d2047273bdade9a009027cfc8979","abstract_canon_sha256":"b4ce5831a5439d2e630cdbb39a9d4ab16d6190fc281a003c6c47e114045cbdbe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:02:55.809655Z","signature_b64":"JeIQ1BfhksIekYqI7zGAOPFgwzSJt3xsBxFii/oRkoFFuUnEOQXXX+bFiONvMvitgz6SmzBf0wtBjzaaD4ewCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7fdaec7d44e4e947ad80238edfb85d3a295dfad0114027435e4bdcc6d8a17673","last_reissued_at":"2026-07-05T09:02:55.809113Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:02:55.809113Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Search Games with Predictions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.GT","authors_text":"Konstantinos Panagiotou, Spyros Angelopoulos, Thomas Lidbetter","submitted_at":"2024-01-02T10:59:29Z","abstract_excerpt":"We introduce the study of search games between a mobile Searcher and an immobile Hider in a new setting in which the Searcher has some potentially erroneous information, i.e., a prediction on the Hider's position. The objective is to establish tight tradeoffs between the consistency of a search strategy (i.e., its worst case expected payoff assuming the prediction is correct) and its robustness (i.e., the worst case expected payoff with no assumptions on the quality of the prediction). Our study is the first to address the full power of mixed (randomized) strategies; previous work focused only"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.01149","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/2401.01149/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":"2401.01149","created_at":"2026-07-05T09:02:55.809183+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.01149v2","created_at":"2026-07-05T09:02:55.809183+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.01149","created_at":"2026-07-05T09:02:55.809183+00:00"},{"alias_kind":"pith_short_12","alias_value":"P7NOY7KE4TUU","created_at":"2026-07-05T09:02:55.809183+00:00"},{"alias_kind":"pith_short_16","alias_value":"P7NOY7KE4TUUPLMA","created_at":"2026-07-05T09:02:55.809183+00:00"},{"alias_kind":"pith_short_8","alias_value":"P7NOY7KE","created_at":"2026-07-05T09:02:55.809183+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.19440","citing_title":"Competitive Search with a Faulty Satnav (GPS): When Probability Matching is Rational","ref_index":6,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/P7NOY7KE4TUUPLMAEOHN7OC5HI","json":"https://pith.science/pith/P7NOY7KE4TUUPLMAEOHN7OC5HI.json","graph_json":"https://pith.science/api/pith-number/P7NOY7KE4TUUPLMAEOHN7OC5HI/graph.json","events_json":"https://pith.science/api/pith-number/P7NOY7KE4TUUPLMAEOHN7OC5HI/events.json","paper":"https://pith.science/paper/P7NOY7KE"},"agent_actions":{"view_html":"https://pith.science/pith/P7NOY7KE4TUUPLMAEOHN7OC5HI","download_json":"https://pith.science/pith/P7NOY7KE4TUUPLMAEOHN7OC5HI.json","view_paper":"https://pith.science/paper/P7NOY7KE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.01149&json=true","fetch_graph":"https://pith.science/api/pith-number/P7NOY7KE4TUUPLMAEOHN7OC5HI/graph.json","fetch_events":"https://pith.science/api/pith-number/P7NOY7KE4TUUPLMAEOHN7OC5HI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P7NOY7KE4TUUPLMAEOHN7OC5HI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P7NOY7KE4TUUPLMAEOHN7OC5HI/action/storage_attestation","attest_author":"https://pith.science/pith/P7NOY7KE4TUUPLMAEOHN7OC5HI/action/author_attestation","sign_citation":"https://pith.science/pith/P7NOY7KE4TUUPLMAEOHN7OC5HI/action/citation_signature","submit_replication":"https://pith.science/pith/P7NOY7KE4TUUPLMAEOHN7OC5HI/action/replication_record"}},"created_at":"2026-07-05T09:02:55.809183+00:00","updated_at":"2026-07-05T09:02:55.809183+00:00"}