{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:757QA7YMXMJWXFQY6EETTEIEN6","short_pith_number":"pith:757QA7YM","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"},"canonical_sha256":"ff7f007f0cbb136b9618f1093991046fa302abda3266bade8112cd07eec8d9c0","source":{"kind":"arxiv","id":"1702.00635","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.00635","created_at":"2026-05-18T00:51:31Z"},{"alias_kind":"arxiv_version","alias_value":"1702.00635v1","created_at":"2026-05-18T00:51:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.00635","created_at":"2026-05-18T00:51:31Z"},{"alias_kind":"pith_short_12","alias_value":"757QA7YMXMJW","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"757QA7YMXMJWXFQY","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"757QA7YM","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:757QA7YMXMJWXFQY6EETTEIEN6","target":"record","payload":{"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"},"canonical_sha256":"ff7f007f0cbb136b9618f1093991046fa302abda3266bade8112cd07eec8d9c0","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"},"source_kind":"arxiv","source_id":"1702.00635","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:51:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0Csrj7gj7sMh3Ugwla1n2umTERiv/RqQvboNJl0rI/bXXGpRAweBlvJ1blJeDeN7TtJSPhx9CYEcqnjbxcPaCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:26:12.097579Z"},"content_sha256":"5cec4528ff799af7c364a07cbec9abd83691506b172986726bcc7e92d1a3a3bd","schema_version":"1.0","event_id":"sha256:5cec4528ff799af7c364a07cbec9abd83691506b172986726bcc7e92d1a3a3bd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:757QA7YMXMJWXFQY6EETTEIEN6","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:51:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QEUjnGRt4sqaE/nfhSWWjr8IwGtl2l88/iz/VazmDvEtR8NteML57ed6C9BB/1Dx9+DCtJ0eevjFZ0jUPmkaBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:26:12.097977Z"},"content_sha256":"9ab691c7ec020b7038c888854d96d5d845e1489af46d42cecb87083245294b15","schema_version":"1.0","event_id":"sha256:9ab691c7ec020b7038c888854d96d5d845e1489af46d42cecb87083245294b15"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/757QA7YMXMJWXFQY6EETTEIEN6/bundle.json","state_url":"https://pith.science/pith/757QA7YMXMJWXFQY6EETTEIEN6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/757QA7YMXMJWXFQY6EETTEIEN6/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T05:26:12Z","links":{"resolver":"https://pith.science/pith/757QA7YMXMJWXFQY6EETTEIEN6","bundle":"https://pith.science/pith/757QA7YMXMJWXFQY6EETTEIEN6/bundle.json","state":"https://pith.science/pith/757QA7YMXMJWXFQY6EETTEIEN6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/757QA7YMXMJWXFQY6EETTEIEN6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:757QA7YMXMJWXFQY6EETTEIEN6","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c589f275b2f1262e4088c59ca10ee0620ef10c4ebbd60a0b67eff004917d03dc","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-02T12:11:27Z","title_canon_sha256":"4a6a0b62d12ea5bafe1f8928619f279e8d5c966ca474a030e0522b7e792370a4"},"schema_version":"1.0","source":{"id":"1702.00635","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.00635","created_at":"2026-05-18T00:51:31Z"},{"alias_kind":"arxiv_version","alias_value":"1702.00635v1","created_at":"2026-05-18T00:51:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.00635","created_at":"2026-05-18T00:51:31Z"},{"alias_kind":"pith_short_12","alias_value":"757QA7YMXMJW","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"757QA7YMXMJWXFQY","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"757QA7YM","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:9ab691c7ec020b7038c888854d96d5d845e1489af46d42cecb87083245294b15","target":"graph","created_at":"2026-05-18T00:51:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"D\\\"om\\\"ot\\\"or P\\'alv\\\"olgyi","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-02T12:11:27Z","title":"All or Nothing Caching Games with Bounded Queries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.00635","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5cec4528ff799af7c364a07cbec9abd83691506b172986726bcc7e92d1a3a3bd","target":"record","created_at":"2026-05-18T00:51:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c589f275b2f1262e4088c59ca10ee0620ef10c4ebbd60a0b67eff004917d03dc","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-02T12:11:27Z","title_canon_sha256":"4a6a0b62d12ea5bafe1f8928619f279e8d5c966ca474a030e0522b7e792370a4"},"schema_version":"1.0","source":{"id":"1702.00635","kind":"arxiv","version":1}},"canonical_sha256":"ff7f007f0cbb136b9618f1093991046fa302abda3266bade8112cd07eec8d9c0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff7f007f0cbb136b9618f1093991046fa302abda3266bade8112cd07eec8d9c0","first_computed_at":"2026-05-18T00:51:31.314714Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:31.314714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sdmoLqfviXl+oJBDlwcaxxHVKKzR5th/f+a7RHDrk/CwsB2HFNyDKbyn7Jkh4/IaQpHpre9EmyHO9phCGwY0Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:31.315182Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.00635","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5cec4528ff799af7c364a07cbec9abd83691506b172986726bcc7e92d1a3a3bd","sha256:9ab691c7ec020b7038c888854d96d5d845e1489af46d42cecb87083245294b15"],"state_sha256":"5a74a6beadaa2ead1acfc2703802dc80c13cbbf4f3207f3353a88105b235a75f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AUqmk9wTJskayItzBPao7ONHPqtVVGtb5DhHU1dp71qhfuEqtFixGfx4v5UTdVqlN/xQFJahbb6j7SNjewIHDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T05:26:12.100160Z","bundle_sha256":"9ff85c52ba4846342307b4a6bd6b4772ebf7ef6beda64a5bb3c28e3e8b63b740"}}