{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:WP66ISHNNFXDSI5RJR7S4VK65X","short_pith_number":"pith:WP66ISHN","schema_version":"1.0","canonical_sha256":"b3fde448ed696e3923b14c7f2e555eedf2d90e0a6958106a0172fe429c081135","source":{"kind":"arxiv","id":"2603.04909","version":2},"attestation_state":"computed","paper":{"title":"Hat guessing with proper colorings","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anurag Bishnoi, Anurag Ramachandran, James Tuite, Lars van der Kuil, Michael Kreiger, Peter Bentley, Sam Adriaensen, Saptarshi Mandal","submitted_at":"2026-03-05T07:52:36Z","abstract_excerpt":"We initiate the study of the hat guessing number of a graph where the adversary is only allowed to provide a proper coloring of the graph. This is the largest number $q$ for which there is a guessing strategy on each vertex that only depends on its neighborhood, such that for every proper coloring of the graph with $q$ colors at least one vertex guesses its color correctly. In this variation, we prove that the hat guessing number of the complete graphs on $n$ vertices is $2n - 1$, which is roughly twice the classical hat guessing number of the complete graph. Our winning strategy is related to"},"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":"2603.04909","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-03-05T07:52:36Z","cross_cats_sorted":[],"title_canon_sha256":"7858581859eb340068e865613d2c99e3597f8b82dc079bd84c1730200b9da6c1","abstract_canon_sha256":"547a7ff5f2e7a5bf2244c1f318cff0a20abfaab6999e3943fad5763e907884f1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T02:08:40.550878Z","signature_b64":"ubRH93Eur/p0mKYTaVhFZSzzL9CFov9fDhBlU7PCvvSBy/F4/GSRAYCNAPUGFZ+52hvbAB9Yxv3ZmIT6oo2wCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3fde448ed696e3923b14c7f2e555eedf2d90e0a6958106a0172fe429c081135","last_reissued_at":"2026-06-09T02:08:40.549780Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T02:08:40.549780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hat guessing with proper colorings","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anurag Bishnoi, Anurag Ramachandran, James Tuite, Lars van der Kuil, Michael Kreiger, Peter Bentley, Sam Adriaensen, Saptarshi Mandal","submitted_at":"2026-03-05T07:52:36Z","abstract_excerpt":"We initiate the study of the hat guessing number of a graph where the adversary is only allowed to provide a proper coloring of the graph. This is the largest number $q$ for which there is a guessing strategy on each vertex that only depends on its neighborhood, such that for every proper coloring of the graph with $q$ colors at least one vertex guesses its color correctly. In this variation, we prove that the hat guessing number of the complete graphs on $n$ vertices is $2n - 1$, which is roughly twice the classical hat guessing number of the complete graph. Our winning strategy is related to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.04909","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/2603.04909/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2603.04909","created_at":"2026-06-09T02:08:40.549923+00:00"},{"alias_kind":"arxiv_version","alias_value":"2603.04909v2","created_at":"2026-06-09T02:08:40.549923+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.04909","created_at":"2026-06-09T02:08:40.549923+00:00"},{"alias_kind":"pith_short_12","alias_value":"WP66ISHNNFXD","created_at":"2026-06-09T02:08:40.549923+00:00"},{"alias_kind":"pith_short_16","alias_value":"WP66ISHNNFXDSI5R","created_at":"2026-06-09T02:08:40.549923+00:00"},{"alias_kind":"pith_short_8","alias_value":"WP66ISHN","created_at":"2026-06-09T02:08:40.549923+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/WP66ISHNNFXDSI5RJR7S4VK65X","json":"https://pith.science/pith/WP66ISHNNFXDSI5RJR7S4VK65X.json","graph_json":"https://pith.science/api/pith-number/WP66ISHNNFXDSI5RJR7S4VK65X/graph.json","events_json":"https://pith.science/api/pith-number/WP66ISHNNFXDSI5RJR7S4VK65X/events.json","paper":"https://pith.science/paper/WP66ISHN"},"agent_actions":{"view_html":"https://pith.science/pith/WP66ISHNNFXDSI5RJR7S4VK65X","download_json":"https://pith.science/pith/WP66ISHNNFXDSI5RJR7S4VK65X.json","view_paper":"https://pith.science/paper/WP66ISHN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2603.04909&json=true","fetch_graph":"https://pith.science/api/pith-number/WP66ISHNNFXDSI5RJR7S4VK65X/graph.json","fetch_events":"https://pith.science/api/pith-number/WP66ISHNNFXDSI5RJR7S4VK65X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WP66ISHNNFXDSI5RJR7S4VK65X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WP66ISHNNFXDSI5RJR7S4VK65X/action/storage_attestation","attest_author":"https://pith.science/pith/WP66ISHNNFXDSI5RJR7S4VK65X/action/author_attestation","sign_citation":"https://pith.science/pith/WP66ISHNNFXDSI5RJR7S4VK65X/action/citation_signature","submit_replication":"https://pith.science/pith/WP66ISHNNFXDSI5RJR7S4VK65X/action/replication_record"}},"created_at":"2026-06-09T02:08:40.549923+00:00","updated_at":"2026-06-09T02:08:40.549923+00:00"}