{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:HXY4DZRNZKOQIECTAX3AC2C3SD","short_pith_number":"pith:HXY4DZRN","schema_version":"1.0","canonical_sha256":"3df1c1e62dca9d04105305f601685b90cc30ad7de3cfe8b9823d1e96ffe4fb4d","source":{"kind":"arxiv","id":"1101.0869","version":2},"attestation_state":"computed","paper":{"title":"A New Variation of Hat Guessing Games","license":"http://creativecommons.org/licenses/publicdomain/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Huacheng Yu, Tengyu Ma, Xiaoming Sun","submitted_at":"2011-01-05T02:13:50Z","abstract_excerpt":"Several variations of hat guessing games have been popularly discussed in recreational mathematics. In a typical hat guessing game, after initially coordinating a strategy, each of $n$ players is assigned a hat from a given color set. Simultaneously, each player tries to guess the color of his/her own hat by looking at colors of hats worn by other players. In this paper, we consider a new variation of this game, in which we require at least $k$ correct guesses and no wrong guess for the players to win the game, but they can choose to \"pass\".\n  A strategy is called {\\em perfect} if it can achie"},"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":"1101.0869","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"math.CO","submitted_at":"2011-01-05T02:13:50Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"d72bc8d26a076a38066dd01b4cb99c5bbe3440dea9a6a8c22571afb1a6d272da","abstract_canon_sha256":"533ade7dbc4c45eb3912fcbb312963f16720400b534a079f01fa2b6df0cb683b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:31:22.014062Z","signature_b64":"KjwlJXFKbNjzPQQtx34azL04Md52J4Hg4LpSyhSSFjA0PVKwymTwZnWa1EsDMijsgtvAlbozFUGcmwgH23emBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3df1c1e62dca9d04105305f601685b90cc30ad7de3cfe8b9823d1e96ffe4fb4d","last_reissued_at":"2026-05-18T04:31:22.013672Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:31:22.013672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A New Variation of Hat Guessing Games","license":"http://creativecommons.org/licenses/publicdomain/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Huacheng Yu, Tengyu Ma, Xiaoming Sun","submitted_at":"2011-01-05T02:13:50Z","abstract_excerpt":"Several variations of hat guessing games have been popularly discussed in recreational mathematics. In a typical hat guessing game, after initially coordinating a strategy, each of $n$ players is assigned a hat from a given color set. Simultaneously, each player tries to guess the color of his/her own hat by looking at colors of hats worn by other players. In this paper, we consider a new variation of this game, in which we require at least $k$ correct guesses and no wrong guess for the players to win the game, but they can choose to \"pass\".\n  A strategy is called {\\em perfect} if it can achie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.0869","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":""},"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":"1101.0869","created_at":"2026-05-18T04:31:22.013729+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.0869v2","created_at":"2026-05-18T04:31:22.013729+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.0869","created_at":"2026-05-18T04:31:22.013729+00:00"},{"alias_kind":"pith_short_12","alias_value":"HXY4DZRNZKOQ","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"HXY4DZRNZKOQIECT","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"HXY4DZRN","created_at":"2026-05-18T12:26:30.835961+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/HXY4DZRNZKOQIECTAX3AC2C3SD","json":"https://pith.science/pith/HXY4DZRNZKOQIECTAX3AC2C3SD.json","graph_json":"https://pith.science/api/pith-number/HXY4DZRNZKOQIECTAX3AC2C3SD/graph.json","events_json":"https://pith.science/api/pith-number/HXY4DZRNZKOQIECTAX3AC2C3SD/events.json","paper":"https://pith.science/paper/HXY4DZRN"},"agent_actions":{"view_html":"https://pith.science/pith/HXY4DZRNZKOQIECTAX3AC2C3SD","download_json":"https://pith.science/pith/HXY4DZRNZKOQIECTAX3AC2C3SD.json","view_paper":"https://pith.science/paper/HXY4DZRN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.0869&json=true","fetch_graph":"https://pith.science/api/pith-number/HXY4DZRNZKOQIECTAX3AC2C3SD/graph.json","fetch_events":"https://pith.science/api/pith-number/HXY4DZRNZKOQIECTAX3AC2C3SD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HXY4DZRNZKOQIECTAX3AC2C3SD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HXY4DZRNZKOQIECTAX3AC2C3SD/action/storage_attestation","attest_author":"https://pith.science/pith/HXY4DZRNZKOQIECTAX3AC2C3SD/action/author_attestation","sign_citation":"https://pith.science/pith/HXY4DZRNZKOQIECTAX3AC2C3SD/action/citation_signature","submit_replication":"https://pith.science/pith/HXY4DZRNZKOQIECTAX3AC2C3SD/action/replication_record"}},"created_at":"2026-05-18T04:31:22.013729+00:00","updated_at":"2026-05-18T04:31:22.013729+00:00"}