{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:42EJLWHSALCSBAIKX5LEFIK6KK","short_pith_number":"pith:42EJLWHS","canonical_record":{"source":{"id":"1810.08263","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-18T20:03:15Z","cross_cats_sorted":[],"title_canon_sha256":"6402ea122dafc24d5d7488a9733dcb8df82cb09460b3d64a4755cc840295a0b7","abstract_canon_sha256":"d8af422da8abbee74fdb7d010b31a89c758f34c8b8e89244882b2d9865e11459"},"schema_version":"1.0"},"canonical_sha256":"e68895d8f202c520810abf5642a15e52b6c0e1c81d9ce7e7a730241f67954dc3","source":{"kind":"arxiv","id":"1810.08263","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.08263","created_at":"2026-05-17T23:50:41Z"},{"alias_kind":"arxiv_version","alias_value":"1810.08263v5","created_at":"2026-05-17T23:50:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.08263","created_at":"2026-05-17T23:50:41Z"},{"alias_kind":"pith_short_12","alias_value":"42EJLWHSALCS","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"42EJLWHSALCSBAIK","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"42EJLWHS","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:42EJLWHSALCSBAIKX5LEFIK6KK","target":"record","payload":{"canonical_record":{"source":{"id":"1810.08263","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-18T20:03:15Z","cross_cats_sorted":[],"title_canon_sha256":"6402ea122dafc24d5d7488a9733dcb8df82cb09460b3d64a4755cc840295a0b7","abstract_canon_sha256":"d8af422da8abbee74fdb7d010b31a89c758f34c8b8e89244882b2d9865e11459"},"schema_version":"1.0"},"canonical_sha256":"e68895d8f202c520810abf5642a15e52b6c0e1c81d9ce7e7a730241f67954dc3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:41.028367Z","signature_b64":"GWbg4Foj/nFbr+f8rMPS03/KxWmAwdI4scLV6bmCWDDFoMn9yaLHq8NKb5aR2xHaE3DIdvXrC7T8SuuJY9kCDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e68895d8f202c520810abf5642a15e52b6c0e1c81d9ce7e7a730241f67954dc3","last_reissued_at":"2026-05-17T23:50:41.027925Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:41.027925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.08263","source_version":5,"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-17T23:50:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ap1S3tnJeCsH2R/SPfM8nPmBsG6E53kD9aG/Hb3fWIoeWzwOPIQrVSz/sahTj8L8nqjQ6vo3GISfzjdnc29qCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T06:02:45.100085Z"},"content_sha256":"f3e0869ad8bec20dd8e60eddde41883e72c2a296767c52b7c2ef9b677446ec76","schema_version":"1.0","event_id":"sha256:f3e0869ad8bec20dd8e60eddde41883e72c2a296767c52b7c2ef9b677446ec76"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:42EJLWHSALCSBAIKX5LEFIK6KK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Too Many Hats","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michael Wiener, Piotr Zielinski, Rob Pratt, Stan Wagon","submitted_at":"2018-10-18T20:03:15Z","abstract_excerpt":"A puzzle about prisoners trying to identify the color of a hat on their head leads to a version where there are k more hats than prisoners. This generalized puzzle is related to the independence number of the arrangement graph A(m, n) and to Steiner systems and other designs. A natural conjecture is that perfect hat-guessing strategies exist in all cases, where \"perfect\" means that the success probability is 1/(k+1). This is true when k = 1, but we show that it is false when k = 2. Further, we present a strategy with success rate at least 1/O(k log k), independent of the number of prisoners."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.08263","kind":"arxiv","version":5},"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-17T23:50:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zvO4QqjIe6IRupfG2zAoZAjvEOIYTgNtCF4WbuSrGEB2uzG8OyIavNqJeOF2ZSKTjTAPL85Mk7hd4i2GmJZ9Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T06:02:45.100562Z"},"content_sha256":"65d4ee3132d060ffbc031f3db5007d5fa71cba21e8ddcd760b7de32ff587bf8e","schema_version":"1.0","event_id":"sha256:65d4ee3132d060ffbc031f3db5007d5fa71cba21e8ddcd760b7de32ff587bf8e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/42EJLWHSALCSBAIKX5LEFIK6KK/bundle.json","state_url":"https://pith.science/pith/42EJLWHSALCSBAIKX5LEFIK6KK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/42EJLWHSALCSBAIKX5LEFIK6KK/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-24T06:02:45Z","links":{"resolver":"https://pith.science/pith/42EJLWHSALCSBAIKX5LEFIK6KK","bundle":"https://pith.science/pith/42EJLWHSALCSBAIKX5LEFIK6KK/bundle.json","state":"https://pith.science/pith/42EJLWHSALCSBAIKX5LEFIK6KK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/42EJLWHSALCSBAIKX5LEFIK6KK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:42EJLWHSALCSBAIKX5LEFIK6KK","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":"d8af422da8abbee74fdb7d010b31a89c758f34c8b8e89244882b2d9865e11459","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-18T20:03:15Z","title_canon_sha256":"6402ea122dafc24d5d7488a9733dcb8df82cb09460b3d64a4755cc840295a0b7"},"schema_version":"1.0","source":{"id":"1810.08263","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.08263","created_at":"2026-05-17T23:50:41Z"},{"alias_kind":"arxiv_version","alias_value":"1810.08263v5","created_at":"2026-05-17T23:50:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.08263","created_at":"2026-05-17T23:50:41Z"},{"alias_kind":"pith_short_12","alias_value":"42EJLWHSALCS","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"42EJLWHSALCSBAIK","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"42EJLWHS","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:65d4ee3132d060ffbc031f3db5007d5fa71cba21e8ddcd760b7de32ff587bf8e","target":"graph","created_at":"2026-05-17T23:50:41Z","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":"A puzzle about prisoners trying to identify the color of a hat on their head leads to a version where there are k more hats than prisoners. This generalized puzzle is related to the independence number of the arrangement graph A(m, n) and to Steiner systems and other designs. A natural conjecture is that perfect hat-guessing strategies exist in all cases, where \"perfect\" means that the success probability is 1/(k+1). This is true when k = 1, but we show that it is false when k = 2. Further, we present a strategy with success rate at least 1/O(k log k), independent of the number of prisoners.","authors_text":"Michael Wiener, Piotr Zielinski, Rob Pratt, Stan Wagon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-18T20:03:15Z","title":"Too Many Hats"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.08263","kind":"arxiv","version":5},"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:f3e0869ad8bec20dd8e60eddde41883e72c2a296767c52b7c2ef9b677446ec76","target":"record","created_at":"2026-05-17T23:50:41Z","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":"d8af422da8abbee74fdb7d010b31a89c758f34c8b8e89244882b2d9865e11459","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-18T20:03:15Z","title_canon_sha256":"6402ea122dafc24d5d7488a9733dcb8df82cb09460b3d64a4755cc840295a0b7"},"schema_version":"1.0","source":{"id":"1810.08263","kind":"arxiv","version":5}},"canonical_sha256":"e68895d8f202c520810abf5642a15e52b6c0e1c81d9ce7e7a730241f67954dc3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e68895d8f202c520810abf5642a15e52b6c0e1c81d9ce7e7a730241f67954dc3","first_computed_at":"2026-05-17T23:50:41.027925Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:41.027925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GWbg4Foj/nFbr+f8rMPS03/KxWmAwdI4scLV6bmCWDDFoMn9yaLHq8NKb5aR2xHaE3DIdvXrC7T8SuuJY9kCDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:41.028367Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.08263","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f3e0869ad8bec20dd8e60eddde41883e72c2a296767c52b7c2ef9b677446ec76","sha256:65d4ee3132d060ffbc031f3db5007d5fa71cba21e8ddcd760b7de32ff587bf8e"],"state_sha256":"267e1fdbd4e08de7ea4234372ba6eca7829e413677df4c2572216c670e0bc6b0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4bkWFxye6VhnnPkks73QadKfB3mX7XKhI6pGNk7ddO9jhzqmG4spNz6KCNMr2ut1lZWeSINteT9huMUuYQxCCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T06:02:45.103096Z","bundle_sha256":"befd6ed095763ccedd483aace642b1a2a36b239d63e29fe1107ad070d43f1a24"}}