{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:G2XYIIBZB6RDN7P5XNH3JWZXWY","short_pith_number":"pith:G2XYIIBZ","canonical_record":{"source":{"id":"1505.06984","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-05-25T17:19:29Z","cross_cats_sorted":["cs.DM","math.CO","math.PR"],"title_canon_sha256":"824bdb8f821edf1aab3ec3d85d1a2698088fc71d3e87bc3659465ebe844cbe3c","abstract_canon_sha256":"8f9671a27219bb19ddc447c6fc5a97fd303df4b3445a1b78363b0bc395a48ad1"},"schema_version":"1.0"},"canonical_sha256":"36af8420390fa236fdfdbb4fb4db37b630ac6d82ae100c83e5eaf133fdcc9a36","source":{"kind":"arxiv","id":"1505.06984","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.06984","created_at":"2026-05-18T00:42:07Z"},{"alias_kind":"arxiv_version","alias_value":"1505.06984v3","created_at":"2026-05-18T00:42:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.06984","created_at":"2026-05-18T00:42:07Z"},{"alias_kind":"pith_short_12","alias_value":"G2XYIIBZB6RD","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"G2XYIIBZB6RDN7P5","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"G2XYIIBZ","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:G2XYIIBZB6RDN7P5XNH3JWZXWY","target":"record","payload":{"canonical_record":{"source":{"id":"1505.06984","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-05-25T17:19:29Z","cross_cats_sorted":["cs.DM","math.CO","math.PR"],"title_canon_sha256":"824bdb8f821edf1aab3ec3d85d1a2698088fc71d3e87bc3659465ebe844cbe3c","abstract_canon_sha256":"8f9671a27219bb19ddc447c6fc5a97fd303df4b3445a1b78363b0bc395a48ad1"},"schema_version":"1.0"},"canonical_sha256":"36af8420390fa236fdfdbb4fb4db37b630ac6d82ae100c83e5eaf133fdcc9a36","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:07.938604Z","signature_b64":"k4Ln6ZhNdgA+0eWHtx8sHHIndJjcUipi/R0iCrOWwjf8Uj2m4/slWld2VkfmleukeIrKSCpsw+DyN6noY5XfCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36af8420390fa236fdfdbb4fb4db37b630ac6d82ae100c83e5eaf133fdcc9a36","last_reissued_at":"2026-05-18T00:42:07.937942Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:07.937942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.06984","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-18T00:42:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CfPk7V6ZbqLNlZBZ5vzsOEsxxRafTi202/eKdEBhFsV6yXPnXCuQKkZLQl+PlA8uM0H1Lb8C7yU8KtofJm1+DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:16:45.368452Z"},"content_sha256":"04393b178473067dc73c637ea2a6a9ca561a94bb9881f3f8cb7abb9b8a3f1591","schema_version":"1.0","event_id":"sha256:04393b178473067dc73c637ea2a6a9ca561a94bb9881f3f8cb7abb9b8a3f1591"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:G2XYIIBZB6RDN7P5XNH3JWZXWY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Limit theory of discrete mathematics problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO","math.PR"],"primary_cat":"cs.GT","authors_text":"Endre Cs\\'oka","submitted_at":"2015-05-25T17:19:29Z","abstract_excerpt":"We show a general problem-solving tool called limit theory. This is an advanced version of asymptotic analysis of discrete problems when some finite parameter tends to infinity. We will apply it on three closely related problems. Alpern's Caching Game (for 2 nuts) is defined as follows. The hider caches 2 nuts into one or two of $n$ potential holes by digging at most 1 depth in total. The goal of the searcher is to find both nuts in a limited time $h$, otherwise the hider wins. We will show that if $h$ and $n/h$ are large enough, then very counterintuitively, any optimal hiding strategy should"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.06984","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-18T00:42:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qUVovR2BPMQkTgF8TR6VrpBDl8ft3xcO9mEv2AcbSiEl508fbXKOwWlSVOrfyIvmHSYrmzwZjP7vqCEnVnuEBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:16:45.369162Z"},"content_sha256":"ab4580d1cb261a9a716678bfa7c14625fe62abbf636a325dee392310ab2079aa","schema_version":"1.0","event_id":"sha256:ab4580d1cb261a9a716678bfa7c14625fe62abbf636a325dee392310ab2079aa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G2XYIIBZB6RDN7P5XNH3JWZXWY/bundle.json","state_url":"https://pith.science/pith/G2XYIIBZB6RDN7P5XNH3JWZXWY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G2XYIIBZB6RDN7P5XNH3JWZXWY/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-02T22:16:45Z","links":{"resolver":"https://pith.science/pith/G2XYIIBZB6RDN7P5XNH3JWZXWY","bundle":"https://pith.science/pith/G2XYIIBZB6RDN7P5XNH3JWZXWY/bundle.json","state":"https://pith.science/pith/G2XYIIBZB6RDN7P5XNH3JWZXWY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G2XYIIBZB6RDN7P5XNH3JWZXWY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:G2XYIIBZB6RDN7P5XNH3JWZXWY","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":"8f9671a27219bb19ddc447c6fc5a97fd303df4b3445a1b78363b0bc395a48ad1","cross_cats_sorted":["cs.DM","math.CO","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-05-25T17:19:29Z","title_canon_sha256":"824bdb8f821edf1aab3ec3d85d1a2698088fc71d3e87bc3659465ebe844cbe3c"},"schema_version":"1.0","source":{"id":"1505.06984","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.06984","created_at":"2026-05-18T00:42:07Z"},{"alias_kind":"arxiv_version","alias_value":"1505.06984v3","created_at":"2026-05-18T00:42:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.06984","created_at":"2026-05-18T00:42:07Z"},{"alias_kind":"pith_short_12","alias_value":"G2XYIIBZB6RD","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"G2XYIIBZB6RDN7P5","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"G2XYIIBZ","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:ab4580d1cb261a9a716678bfa7c14625fe62abbf636a325dee392310ab2079aa","target":"graph","created_at":"2026-05-18T00:42:07Z","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 show a general problem-solving tool called limit theory. This is an advanced version of asymptotic analysis of discrete problems when some finite parameter tends to infinity. We will apply it on three closely related problems. Alpern's Caching Game (for 2 nuts) is defined as follows. The hider caches 2 nuts into one or two of $n$ potential holes by digging at most 1 depth in total. The goal of the searcher is to find both nuts in a limited time $h$, otherwise the hider wins. We will show that if $h$ and $n/h$ are large enough, then very counterintuitively, any optimal hiding strategy should","authors_text":"Endre Cs\\'oka","cross_cats":["cs.DM","math.CO","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-05-25T17:19:29Z","title":"Limit theory of discrete mathematics problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.06984","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:04393b178473067dc73c637ea2a6a9ca561a94bb9881f3f8cb7abb9b8a3f1591","target":"record","created_at":"2026-05-18T00:42:07Z","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":"8f9671a27219bb19ddc447c6fc5a97fd303df4b3445a1b78363b0bc395a48ad1","cross_cats_sorted":["cs.DM","math.CO","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-05-25T17:19:29Z","title_canon_sha256":"824bdb8f821edf1aab3ec3d85d1a2698088fc71d3e87bc3659465ebe844cbe3c"},"schema_version":"1.0","source":{"id":"1505.06984","kind":"arxiv","version":3}},"canonical_sha256":"36af8420390fa236fdfdbb4fb4db37b630ac6d82ae100c83e5eaf133fdcc9a36","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"36af8420390fa236fdfdbb4fb4db37b630ac6d82ae100c83e5eaf133fdcc9a36","first_computed_at":"2026-05-18T00:42:07.937942Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:07.937942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"k4Ln6ZhNdgA+0eWHtx8sHHIndJjcUipi/R0iCrOWwjf8Uj2m4/slWld2VkfmleukeIrKSCpsw+DyN6noY5XfCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:07.938604Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.06984","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:04393b178473067dc73c637ea2a6a9ca561a94bb9881f3f8cb7abb9b8a3f1591","sha256:ab4580d1cb261a9a716678bfa7c14625fe62abbf636a325dee392310ab2079aa"],"state_sha256":"649f26679ad8542909a47f29abeac569ba0d7ee81d4c5b882f857b8126762b60"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U8sQKZxXkFaDcH0XU4bPn5MDKL5+xWT23nYyVEm1T7mmO1VB1pXqP5AdirjTQNt4lqAT62rgwpMtp6i4m+MuCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T22:16:45.374086Z","bundle_sha256":"54d7cd7ac7b5766058cf1c688ca1fb14b92a9a95483b64a1659a3e853b3227c6"}}