{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:757QA7YMXMJWXFQY6EETTEIEN6","short_pith_number":"pith:757QA7YM","schema_version":"1.0","canonical_sha256":"ff7f007f0cbb136b9618f1093991046fa302abda3266bade8112cd07eec8d9c0","source":{"kind":"arxiv","id":"1702.00635","version":1},"attestation_state":"computed","paper":{"title":"All or Nothing Caching Games with Bounded Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"D\\\"om\\\"ot\\\"or P\\'alv\\\"olgyi","submitted_at":"2017-02-02T12:11:27Z","abstract_excerpt":"We determine the value of some search games where our goal is to find all of some hidden treasures using queries of bounded size. The answer to a query is either empty, in which case we lose, or a location, which contains a treasure. We prove that if we need to find $d$ treasures at $n$ possible locations with queries of size at most $k$, then our chance of winning is $\\frac{k^d}{\\binom nd}$ if each treasure is at a different location and $\\frac{k^d}{\\binom{n+d-1}d}$ if each location might hide several treasures for large enough $n$. Our work builds on some results by Cs\\'oka who has studied 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":"1702.00635","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-02T12:11:27Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"4a6a0b62d12ea5bafe1f8928619f279e8d5c966ca474a030e0522b7e792370a4","abstract_canon_sha256":"c589f275b2f1262e4088c59ca10ee0620ef10c4ebbd60a0b67eff004917d03dc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:31.315182Z","signature_b64":"sdmoLqfviXl+oJBDlwcaxxHVKKzR5th/f+a7RHDrk/CwsB2HFNyDKbyn7Jkh4/IaQpHpre9EmyHO9phCGwY0Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff7f007f0cbb136b9618f1093991046fa302abda3266bade8112cd07eec8d9c0","last_reissued_at":"2026-05-18T00:51:31.314714Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:31.314714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"All or Nothing Caching Games with Bounded Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"D\\\"om\\\"ot\\\"or P\\'alv\\\"olgyi","submitted_at":"2017-02-02T12:11:27Z","abstract_excerpt":"We determine the value of some search games where our goal is to find all of some hidden treasures using queries of bounded size. The answer to a query is either empty, in which case we lose, or a location, which contains a treasure. We prove that if we need to find $d$ treasures at $n$ possible locations with queries of size at most $k$, then our chance of winning is $\\frac{k^d}{\\binom nd}$ if each treasure is at a different location and $\\frac{k^d}{\\binom{n+d-1}d}$ if each location might hide several treasures for large enough $n$. Our work builds on some results by Cs\\'oka who has studied a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.00635","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":"1702.00635","created_at":"2026-05-18T00:51:31.314778+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.00635v1","created_at":"2026-05-18T00:51:31.314778+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.00635","created_at":"2026-05-18T00:51:31.314778+00:00"},{"alias_kind":"pith_short_12","alias_value":"757QA7YMXMJW","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"757QA7YMXMJWXFQY","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"757QA7YM","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/757QA7YMXMJWXFQY6EETTEIEN6","json":"https://pith.science/pith/757QA7YMXMJWXFQY6EETTEIEN6.json","graph_json":"https://pith.science/api/pith-number/757QA7YMXMJWXFQY6EETTEIEN6/graph.json","events_json":"https://pith.science/api/pith-number/757QA7YMXMJWXFQY6EETTEIEN6/events.json","paper":"https://pith.science/paper/757QA7YM"},"agent_actions":{"view_html":"https://pith.science/pith/757QA7YMXMJWXFQY6EETTEIEN6","download_json":"https://pith.science/pith/757QA7YMXMJWXFQY6EETTEIEN6.json","view_paper":"https://pith.science/paper/757QA7YM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.00635&json=true","fetch_graph":"https://pith.science/api/pith-number/757QA7YMXMJWXFQY6EETTEIEN6/graph.json","fetch_events":"https://pith.science/api/pith-number/757QA7YMXMJWXFQY6EETTEIEN6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/757QA7YMXMJWXFQY6EETTEIEN6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/757QA7YMXMJWXFQY6EETTEIEN6/action/storage_attestation","attest_author":"https://pith.science/pith/757QA7YMXMJWXFQY6EETTEIEN6/action/author_attestation","sign_citation":"https://pith.science/pith/757QA7YMXMJWXFQY6EETTEIEN6/action/citation_signature","submit_replication":"https://pith.science/pith/757QA7YMXMJWXFQY6EETTEIEN6/action/replication_record"}},"created_at":"2026-05-18T00:51:31.314778+00:00","updated_at":"2026-05-18T00:51:31.314778+00:00"}