{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:42EJLWHSALCSBAIKX5LEFIK6KK","short_pith_number":"pith:42EJLWHS","schema_version":"1.0","canonical_sha256":"e68895d8f202c520810abf5642a15e52b6c0e1c81d9ce7e7a730241f67954dc3","source":{"kind":"arxiv","id":"1810.08263","version":5},"attestation_state":"computed","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1810.08263","created_at":"2026-05-17T23:50:41.027986+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.08263v5","created_at":"2026-05-17T23:50:41.027986+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.08263","created_at":"2026-05-17T23:50:41.027986+00:00"},{"alias_kind":"pith_short_12","alias_value":"42EJLWHSALCS","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"42EJLWHSALCSBAIK","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"42EJLWHS","created_at":"2026-05-18T12:32:05.422762+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/42EJLWHSALCSBAIKX5LEFIK6KK","json":"https://pith.science/pith/42EJLWHSALCSBAIKX5LEFIK6KK.json","graph_json":"https://pith.science/api/pith-number/42EJLWHSALCSBAIKX5LEFIK6KK/graph.json","events_json":"https://pith.science/api/pith-number/42EJLWHSALCSBAIKX5LEFIK6KK/events.json","paper":"https://pith.science/paper/42EJLWHS"},"agent_actions":{"view_html":"https://pith.science/pith/42EJLWHSALCSBAIKX5LEFIK6KK","download_json":"https://pith.science/pith/42EJLWHSALCSBAIKX5LEFIK6KK.json","view_paper":"https://pith.science/paper/42EJLWHS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.08263&json=true","fetch_graph":"https://pith.science/api/pith-number/42EJLWHSALCSBAIKX5LEFIK6KK/graph.json","fetch_events":"https://pith.science/api/pith-number/42EJLWHSALCSBAIKX5LEFIK6KK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/42EJLWHSALCSBAIKX5LEFIK6KK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/42EJLWHSALCSBAIKX5LEFIK6KK/action/storage_attestation","attest_author":"https://pith.science/pith/42EJLWHSALCSBAIKX5LEFIK6KK/action/author_attestation","sign_citation":"https://pith.science/pith/42EJLWHSALCSBAIKX5LEFIK6KK/action/citation_signature","submit_replication":"https://pith.science/pith/42EJLWHSALCSBAIKX5LEFIK6KK/action/replication_record"}},"created_at":"2026-05-17T23:50:41.027986+00:00","updated_at":"2026-05-17T23:50:41.027986+00:00"}