{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:B57IJZFHLZ3DGH4YVIJTDBIIXJ","short_pith_number":"pith:B57IJZFH","schema_version":"1.0","canonical_sha256":"0f7e84e4a75e76331f98aa13318508ba4353032997c5284f474ef9a905d4ab11","source":{"kind":"arxiv","id":"1801.01184","version":1},"attestation_state":"computed","paper":{"title":"A note on the problem of prisoners and hats","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Petr Glivick\\'y","submitted_at":"2018-01-03T21:37:02Z","abstract_excerpt":"We study the famous mathematical puzzle of prisoners and hats. We introduce a framework in which various variants of the problem can be formalized. We examine three particular versions of the problem (each one in fact a class of problems) and completely characterize them as to (non)existence of winning strategies."},"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":"1801.01184","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-03T21:37:02Z","cross_cats_sorted":[],"title_canon_sha256":"68ccef8b57eaa0dc873b150392d29e01532dcd4c0a91ddd6e0d6329d192e21ba","abstract_canon_sha256":"fbf4a87cdb53e946aeccd66dc1250c705699f1d94f13eff3a80a24758e0f0e20"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:42.889555Z","signature_b64":"hg02kOxmJyh432Ym04gZb4a1ly84LQ3CSuuqNd9WuJ/N1SJre+LZD5yFvS2z+6ZTChwf2r3ROtj86pOBhGTdDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f7e84e4a75e76331f98aa13318508ba4353032997c5284f474ef9a905d4ab11","last_reissued_at":"2026-05-18T00:26:42.888913Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:42.888913Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A note on the problem of prisoners and hats","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Petr Glivick\\'y","submitted_at":"2018-01-03T21:37:02Z","abstract_excerpt":"We study the famous mathematical puzzle of prisoners and hats. We introduce a framework in which various variants of the problem can be formalized. We examine three particular versions of the problem (each one in fact a class of problems) and completely characterize them as to (non)existence of winning strategies."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.01184","kind":"arxiv","version":1},"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":"1801.01184","created_at":"2026-05-18T00:26:42.889008+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.01184v1","created_at":"2026-05-18T00:26:42.889008+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.01184","created_at":"2026-05-18T00:26:42.889008+00:00"},{"alias_kind":"pith_short_12","alias_value":"B57IJZFHLZ3D","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"B57IJZFHLZ3DGH4Y","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"B57IJZFH","created_at":"2026-05-18T12:32:13.499390+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/B57IJZFHLZ3DGH4YVIJTDBIIXJ","json":"https://pith.science/pith/B57IJZFHLZ3DGH4YVIJTDBIIXJ.json","graph_json":"https://pith.science/api/pith-number/B57IJZFHLZ3DGH4YVIJTDBIIXJ/graph.json","events_json":"https://pith.science/api/pith-number/B57IJZFHLZ3DGH4YVIJTDBIIXJ/events.json","paper":"https://pith.science/paper/B57IJZFH"},"agent_actions":{"view_html":"https://pith.science/pith/B57IJZFHLZ3DGH4YVIJTDBIIXJ","download_json":"https://pith.science/pith/B57IJZFHLZ3DGH4YVIJTDBIIXJ.json","view_paper":"https://pith.science/paper/B57IJZFH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.01184&json=true","fetch_graph":"https://pith.science/api/pith-number/B57IJZFHLZ3DGH4YVIJTDBIIXJ/graph.json","fetch_events":"https://pith.science/api/pith-number/B57IJZFHLZ3DGH4YVIJTDBIIXJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B57IJZFHLZ3DGH4YVIJTDBIIXJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B57IJZFHLZ3DGH4YVIJTDBIIXJ/action/storage_attestation","attest_author":"https://pith.science/pith/B57IJZFHLZ3DGH4YVIJTDBIIXJ/action/author_attestation","sign_citation":"https://pith.science/pith/B57IJZFHLZ3DGH4YVIJTDBIIXJ/action/citation_signature","submit_replication":"https://pith.science/pith/B57IJZFHLZ3DGH4YVIJTDBIIXJ/action/replication_record"}},"created_at":"2026-05-18T00:26:42.889008+00:00","updated_at":"2026-05-18T00:26:42.889008+00:00"}