{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:GWFBQTL5LVC3TAMLJG4CMT6YBL","short_pith_number":"pith:GWFBQTL5","schema_version":"1.0","canonical_sha256":"358a184d7d5d45b9818b49b8264fd80ac82677673b902cf1afa1fd6a32efdfbc","source":{"kind":"arxiv","id":"1507.08425","version":3},"attestation_state":"computed","paper":{"title":"The solution to an open problem for a caching game","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Endre Cs\\'oka, Thomas Lidbetter","submitted_at":"2015-07-30T09:07:33Z","abstract_excerpt":"In a caching game introduced by Alpern et al., a Hider who can dig to a total fixed depth normalized to $1$ buries a fixed number of objects among $n$ discrete locations. A Searcher who can dig to a total depth of $h$ searches the locations with the aim of finding all of the hidden objects. If he does so, he wins, otherwise the Hider wins. This zero-sum game is complicated to analyze even for small values of its parameters, and for the case of $2$ hidden objects has been completely solved only when the game is played in up to $3$ locations. For some values of $h$ the solution of the game with "},"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":"1507.08425","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-30T09:07:33Z","cross_cats_sorted":[],"title_canon_sha256":"2414edb2a4f7152737c1563180132df837d0477ac244da7903803efbba2bf2c4","abstract_canon_sha256":"14a6e6316a45f4fd80e814c143ba060b30f8e1eaeb4fa9ea47cf0775ceaf9f9f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:11.523893Z","signature_b64":"kQecjq8hBIVrPc83dOGGJHkxXZe+7kHZieyvaIGH7yjH+CUrQqYEyuL/riWgf6frq6DDdWmb0AHMM9dcgvI0Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"358a184d7d5d45b9818b49b8264fd80ac82677673b902cf1afa1fd6a32efdfbc","last_reissued_at":"2026-05-18T01:25:11.523265Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:11.523265Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The solution to an open problem for a caching game","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Endre Cs\\'oka, Thomas Lidbetter","submitted_at":"2015-07-30T09:07:33Z","abstract_excerpt":"In a caching game introduced by Alpern et al., a Hider who can dig to a total fixed depth normalized to $1$ buries a fixed number of objects among $n$ discrete locations. A Searcher who can dig to a total depth of $h$ searches the locations with the aim of finding all of the hidden objects. If he does so, he wins, otherwise the Hider wins. This zero-sum game is complicated to analyze even for small values of its parameters, and for the case of $2$ hidden objects has been completely solved only when the game is played in up to $3$ locations. For some values of $h$ the solution of the game with "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.08425","kind":"arxiv","version":3},"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":"1507.08425","created_at":"2026-05-18T01:25:11.523372+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.08425v3","created_at":"2026-05-18T01:25:11.523372+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.08425","created_at":"2026-05-18T01:25:11.523372+00:00"},{"alias_kind":"pith_short_12","alias_value":"GWFBQTL5LVC3","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"GWFBQTL5LVC3TAML","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"GWFBQTL5","created_at":"2026-05-18T12:29:22.688609+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/GWFBQTL5LVC3TAMLJG4CMT6YBL","json":"https://pith.science/pith/GWFBQTL5LVC3TAMLJG4CMT6YBL.json","graph_json":"https://pith.science/api/pith-number/GWFBQTL5LVC3TAMLJG4CMT6YBL/graph.json","events_json":"https://pith.science/api/pith-number/GWFBQTL5LVC3TAMLJG4CMT6YBL/events.json","paper":"https://pith.science/paper/GWFBQTL5"},"agent_actions":{"view_html":"https://pith.science/pith/GWFBQTL5LVC3TAMLJG4CMT6YBL","download_json":"https://pith.science/pith/GWFBQTL5LVC3TAMLJG4CMT6YBL.json","view_paper":"https://pith.science/paper/GWFBQTL5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.08425&json=true","fetch_graph":"https://pith.science/api/pith-number/GWFBQTL5LVC3TAMLJG4CMT6YBL/graph.json","fetch_events":"https://pith.science/api/pith-number/GWFBQTL5LVC3TAMLJG4CMT6YBL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GWFBQTL5LVC3TAMLJG4CMT6YBL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GWFBQTL5LVC3TAMLJG4CMT6YBL/action/storage_attestation","attest_author":"https://pith.science/pith/GWFBQTL5LVC3TAMLJG4CMT6YBL/action/author_attestation","sign_citation":"https://pith.science/pith/GWFBQTL5LVC3TAMLJG4CMT6YBL/action/citation_signature","submit_replication":"https://pith.science/pith/GWFBQTL5LVC3TAMLJG4CMT6YBL/action/replication_record"}},"created_at":"2026-05-18T01:25:11.523372+00:00","updated_at":"2026-05-18T01:25:11.523372+00:00"}