{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:GWFBQTL5LVC3TAMLJG4CMT6YBL","short_pith_number":"pith:GWFBQTL5","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"},"canonical_sha256":"358a184d7d5d45b9818b49b8264fd80ac82677673b902cf1afa1fd6a32efdfbc","source":{"kind":"arxiv","id":"1507.08425","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.08425","created_at":"2026-05-18T01:25:11Z"},{"alias_kind":"arxiv_version","alias_value":"1507.08425v3","created_at":"2026-05-18T01:25:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.08425","created_at":"2026-05-18T01:25:11Z"},{"alias_kind":"pith_short_12","alias_value":"GWFBQTL5LVC3","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GWFBQTL5LVC3TAML","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GWFBQTL5","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:GWFBQTL5LVC3TAMLJG4CMT6YBL","target":"record","payload":{"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"},"canonical_sha256":"358a184d7d5d45b9818b49b8264fd80ac82677673b902cf1afa1fd6a32efdfbc","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"},"source_kind":"arxiv","source_id":"1507.08425","source_version":3,"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-18T01:25:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dB2h/qJaS9JO90m+QbOF1JpbX2i2+qHYqDB2SbPbrkiWx+01UYVg/p9E+rjbITkU9PSjIPC59ZNVfMFPFFEXDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:01:39.397756Z"},"content_sha256":"cacdcaa35f4f30e6d3d52b3dda706da83351a1f36625b3e87e20bbb2f4bd376d","schema_version":"1.0","event_id":"sha256:cacdcaa35f4f30e6d3d52b3dda706da83351a1f36625b3e87e20bbb2f4bd376d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:GWFBQTL5LVC3TAMLJG4CMT6YBL","target":"graph","payload":{"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"},"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-18T01:25:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4hkJYUEMnjiXi888296ajkd0StxJMlKBoBR/W1qyLkxM959DjyD+5A5JRD8ICINrkQiVrBoeQpcXJ3OKpiFwBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:01:39.398103Z"},"content_sha256":"3ee0c28b3cc4f7c2473322f17eecda828368ad71de78d256cfd7e224704303c5","schema_version":"1.0","event_id":"sha256:3ee0c28b3cc4f7c2473322f17eecda828368ad71de78d256cfd7e224704303c5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GWFBQTL5LVC3TAMLJG4CMT6YBL/bundle.json","state_url":"https://pith.science/pith/GWFBQTL5LVC3TAMLJG4CMT6YBL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GWFBQTL5LVC3TAMLJG4CMT6YBL/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-03T01:01:39Z","links":{"resolver":"https://pith.science/pith/GWFBQTL5LVC3TAMLJG4CMT6YBL","bundle":"https://pith.science/pith/GWFBQTL5LVC3TAMLJG4CMT6YBL/bundle.json","state":"https://pith.science/pith/GWFBQTL5LVC3TAMLJG4CMT6YBL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GWFBQTL5LVC3TAMLJG4CMT6YBL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GWFBQTL5LVC3TAMLJG4CMT6YBL","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":"14a6e6316a45f4fd80e814c143ba060b30f8e1eaeb4fa9ea47cf0775ceaf9f9f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-30T09:07:33Z","title_canon_sha256":"2414edb2a4f7152737c1563180132df837d0477ac244da7903803efbba2bf2c4"},"schema_version":"1.0","source":{"id":"1507.08425","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.08425","created_at":"2026-05-18T01:25:11Z"},{"alias_kind":"arxiv_version","alias_value":"1507.08425v3","created_at":"2026-05-18T01:25:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.08425","created_at":"2026-05-18T01:25:11Z"},{"alias_kind":"pith_short_12","alias_value":"GWFBQTL5LVC3","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GWFBQTL5LVC3TAML","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GWFBQTL5","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:3ee0c28b3cc4f7c2473322f17eecda828368ad71de78d256cfd7e224704303c5","target":"graph","created_at":"2026-05-18T01:25:11Z","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":"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 ","authors_text":"Endre Cs\\'oka, Thomas Lidbetter","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-30T09:07:33Z","title":"The solution to an open problem for a caching game"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.08425","kind":"arxiv","version":3},"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:cacdcaa35f4f30e6d3d52b3dda706da83351a1f36625b3e87e20bbb2f4bd376d","target":"record","created_at":"2026-05-18T01:25:11Z","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":"14a6e6316a45f4fd80e814c143ba060b30f8e1eaeb4fa9ea47cf0775ceaf9f9f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-30T09:07:33Z","title_canon_sha256":"2414edb2a4f7152737c1563180132df837d0477ac244da7903803efbba2bf2c4"},"schema_version":"1.0","source":{"id":"1507.08425","kind":"arxiv","version":3}},"canonical_sha256":"358a184d7d5d45b9818b49b8264fd80ac82677673b902cf1afa1fd6a32efdfbc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"358a184d7d5d45b9818b49b8264fd80ac82677673b902cf1afa1fd6a32efdfbc","first_computed_at":"2026-05-18T01:25:11.523265Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:25:11.523265Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kQecjq8hBIVrPc83dOGGJHkxXZe+7kHZieyvaIGH7yjH+CUrQqYEyuL/riWgf6frq6DDdWmb0AHMM9dcgvI0Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:25:11.523893Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.08425","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cacdcaa35f4f30e6d3d52b3dda706da83351a1f36625b3e87e20bbb2f4bd376d","sha256:3ee0c28b3cc4f7c2473322f17eecda828368ad71de78d256cfd7e224704303c5"],"state_sha256":"a603421a8b163596ace4ffcbd07dfd880dbca5556cf6abaa90af302cb4bf9763"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yvo6H0C9y9RxMX1ciel7bCHNdp+/3ETqsWL1FCpMMD6plkM/defGAG66FBqIB8xbbVZddMF3XxzhbcnoaWj1DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T01:01:39.400533Z","bundle_sha256":"538a235a8b63091176a609c713ede19e4371fac238906badd089e537037b9a64"}}