{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:EIUXLW2QKSHQG7CUFWQEGRPTPK","short_pith_number":"pith:EIUXLW2Q","canonical_record":{"source":{"id":"2502.10551","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-02-14T20:46:31Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"1403c1585104e869fc5d7ee7868ae7538493af25ed19ec23824b2878cd73d8b6","abstract_canon_sha256":"363e2bb3db0b57e3f2a00d101558ec411f3e7223d0d93df4c4ed4e14c4b99cb3"},"schema_version":"1.0"},"canonical_sha256":"222975db50548f037c542da04345f37aaece00d210969225fee12c8c8d51bd2d","source":{"kind":"arxiv","id":"2502.10551","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.10551","created_at":"2026-07-05T11:00:42Z"},{"alias_kind":"arxiv_version","alias_value":"2502.10551v2","created_at":"2026-07-05T11:00:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.10551","created_at":"2026-07-05T11:00:42Z"},{"alias_kind":"pith_short_12","alias_value":"EIUXLW2QKSHQ","created_at":"2026-07-05T11:00:42Z"},{"alias_kind":"pith_short_16","alias_value":"EIUXLW2QKSHQG7CU","created_at":"2026-07-05T11:00:42Z"},{"alias_kind":"pith_short_8","alias_value":"EIUXLW2Q","created_at":"2026-07-05T11:00:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:EIUXLW2QKSHQG7CUFWQEGRPTPK","target":"record","payload":{"canonical_record":{"source":{"id":"2502.10551","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-02-14T20:46:31Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"1403c1585104e869fc5d7ee7868ae7538493af25ed19ec23824b2878cd73d8b6","abstract_canon_sha256":"363e2bb3db0b57e3f2a00d101558ec411f3e7223d0d93df4c4ed4e14c4b99cb3"},"schema_version":"1.0"},"canonical_sha256":"222975db50548f037c542da04345f37aaece00d210969225fee12c8c8d51bd2d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:00:42.229713Z","signature_b64":"Tw+yf6ngs3cFUE3TjjbJ8Z7xRuw6gi0DTHWfUeWkcqRxBi1YvwyAuxs0ALYpX0MHAYl9kqrZZIRVnfhAnKAhAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"222975db50548f037c542da04345f37aaece00d210969225fee12c8c8d51bd2d","last_reissued_at":"2026-07-05T11:00:42.229222Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:00:42.229222Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.10551","source_version":2,"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-07-05T11:00:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MFUjHXNl9zjhp+7lPfKzUCF/MsHWuC1Qk9pR838ZlvZoVp9d0MHadLZk7+nroXZYzo33exstbXvE7HcByJF5DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T01:40:17.432198Z"},"content_sha256":"ea7382dcd547d196d56739e532f6987c23c56154dbde3fd0710914d067383407","schema_version":"1.0","event_id":"sha256:ea7382dcd547d196d56739e532f6987c23c56154dbde3fd0710914d067383407"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:EIUXLW2QKSHQG7CUFWQEGRPTPK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A review of minimum cost box searching games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.OC","authors_text":"Thomas Lidbetter","submitted_at":"2025-02-14T20:46:31Z","abstract_excerpt":"We consider a class of zero-sum search games in which a Hider hides one or more target among a set of $n$ boxes. The boxes may require differing amount of time to search, and detection may be imperfect, so that there is a certain probability that a target may not be found when a box is searched, even when it is there. A Searcher must choose how to search the boxes sequentially, and wishes to minimize the expected time to find the target(s), whereas the Hider wishes to maximize this payoff. We review some known solutions to different cases of this game."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.10551","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.10551/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T11:00:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M270pCuBCyj5zCDiuGehSBqYJJCjWjOonoOZHOl8arOxP5iIjrysLAAy0Fj2/rGnjq7Uohoe9eMHnPDHrF8/Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T01:40:17.433122Z"},"content_sha256":"2007a294ab586fc63b24b2af2400e233c3e46112be7b0aebb0fdfc0742edb859","schema_version":"1.0","event_id":"sha256:2007a294ab586fc63b24b2af2400e233c3e46112be7b0aebb0fdfc0742edb859"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EIUXLW2QKSHQG7CUFWQEGRPTPK/bundle.json","state_url":"https://pith.science/pith/EIUXLW2QKSHQG7CUFWQEGRPTPK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EIUXLW2QKSHQG7CUFWQEGRPTPK/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-08-10T01:40:17Z","links":{"resolver":"https://pith.science/pith/EIUXLW2QKSHQG7CUFWQEGRPTPK","bundle":"https://pith.science/pith/EIUXLW2QKSHQG7CUFWQEGRPTPK/bundle.json","state":"https://pith.science/pith/EIUXLW2QKSHQG7CUFWQEGRPTPK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EIUXLW2QKSHQG7CUFWQEGRPTPK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:EIUXLW2QKSHQG7CUFWQEGRPTPK","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":"363e2bb3db0b57e3f2a00d101558ec411f3e7223d0d93df4c4ed4e14c4b99cb3","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-02-14T20:46:31Z","title_canon_sha256":"1403c1585104e869fc5d7ee7868ae7538493af25ed19ec23824b2878cd73d8b6"},"schema_version":"1.0","source":{"id":"2502.10551","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.10551","created_at":"2026-07-05T11:00:42Z"},{"alias_kind":"arxiv_version","alias_value":"2502.10551v2","created_at":"2026-07-05T11:00:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.10551","created_at":"2026-07-05T11:00:42Z"},{"alias_kind":"pith_short_12","alias_value":"EIUXLW2QKSHQ","created_at":"2026-07-05T11:00:42Z"},{"alias_kind":"pith_short_16","alias_value":"EIUXLW2QKSHQG7CU","created_at":"2026-07-05T11:00:42Z"},{"alias_kind":"pith_short_8","alias_value":"EIUXLW2Q","created_at":"2026-07-05T11:00:42Z"}],"graph_snapshots":[{"event_id":"sha256:2007a294ab586fc63b24b2af2400e233c3e46112be7b0aebb0fdfc0742edb859","target":"graph","created_at":"2026-07-05T11:00:42Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2502.10551/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider a class of zero-sum search games in which a Hider hides one or more target among a set of $n$ boxes. The boxes may require differing amount of time to search, and detection may be imperfect, so that there is a certain probability that a target may not be found when a box is searched, even when it is there. A Searcher must choose how to search the boxes sequentially, and wishes to minimize the expected time to find the target(s), whereas the Hider wishes to maximize this payoff. We review some known solutions to different cases of this game.","authors_text":"Thomas Lidbetter","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-02-14T20:46:31Z","title":"A review of minimum cost box searching games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.10551","kind":"arxiv","version":2},"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:ea7382dcd547d196d56739e532f6987c23c56154dbde3fd0710914d067383407","target":"record","created_at":"2026-07-05T11:00:42Z","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":"363e2bb3db0b57e3f2a00d101558ec411f3e7223d0d93df4c4ed4e14c4b99cb3","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-02-14T20:46:31Z","title_canon_sha256":"1403c1585104e869fc5d7ee7868ae7538493af25ed19ec23824b2878cd73d8b6"},"schema_version":"1.0","source":{"id":"2502.10551","kind":"arxiv","version":2}},"canonical_sha256":"222975db50548f037c542da04345f37aaece00d210969225fee12c8c8d51bd2d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"222975db50548f037c542da04345f37aaece00d210969225fee12c8c8d51bd2d","first_computed_at":"2026-07-05T11:00:42.229222Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:00:42.229222Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Tw+yf6ngs3cFUE3TjjbJ8Z7xRuw6gi0DTHWfUeWkcqRxBi1YvwyAuxs0ALYpX0MHAYl9kqrZZIRVnfhAnKAhAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:00:42.229713Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.10551","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ea7382dcd547d196d56739e532f6987c23c56154dbde3fd0710914d067383407","sha256:2007a294ab586fc63b24b2af2400e233c3e46112be7b0aebb0fdfc0742edb859"],"state_sha256":"d1550b9fd1f51b4cc2b82ae1539d167ba300e0180679526a06c130b1ca8ae5a5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p6Lcp9fLcv0/cUp12T75s5ZQMV6Capf+kWGMEg7jIhM5Tcnmy1WFS2qBgwOPZcT+d2tqU5y9Up16Z7lUCmIbBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T01:40:17.439953Z","bundle_sha256":"10866b45bf50f03630841847cd09df271cab52e6375b2aa4393f3d780f07d870"}}