{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:WP66ISHNNFXDSI5RJR7S4VK65X","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":"547a7ff5f2e7a5bf2244c1f318cff0a20abfaab6999e3943fad5763e907884f1","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-03-05T07:52:36Z","title_canon_sha256":"7858581859eb340068e865613d2c99e3597f8b82dc079bd84c1730200b9da6c1"},"schema_version":"1.0","source":{"id":"2603.04909","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2603.04909","created_at":"2026-06-09T02:08:40Z"},{"alias_kind":"arxiv_version","alias_value":"2603.04909v2","created_at":"2026-06-09T02:08:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.04909","created_at":"2026-06-09T02:08:40Z"},{"alias_kind":"pith_short_12","alias_value":"WP66ISHNNFXD","created_at":"2026-06-09T02:08:40Z"},{"alias_kind":"pith_short_16","alias_value":"WP66ISHNNFXDSI5R","created_at":"2026-06-09T02:08:40Z"},{"alias_kind":"pith_short_8","alias_value":"WP66ISHN","created_at":"2026-06-09T02:08:40Z"}],"graph_snapshots":[{"event_id":"sha256:aac9d13a181b33f648ee140c6420f0e3f5555b31111b7dc8b85d6e785569bacb","target":"graph","created_at":"2026-06-09T02:08:40Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2603.04909/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Anurag Bishnoi, Anurag Ramachandran, James Tuite, Lars van der Kuil, Michael Kreiger, Peter Bentley, Sam Adriaensen, Saptarshi Mandal","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-03-05T07:52:36Z","title":"Hat guessing with proper colorings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.04909","kind":"arxiv","version":2},"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:755177a7a30e901d808c0225c1966c8796c0a9c0f3ffb7aa1fe146d3732b83b5","target":"record","created_at":"2026-06-09T02:08:40Z","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":"547a7ff5f2e7a5bf2244c1f318cff0a20abfaab6999e3943fad5763e907884f1","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-03-05T07:52:36Z","title_canon_sha256":"7858581859eb340068e865613d2c99e3597f8b82dc079bd84c1730200b9da6c1"},"schema_version":"1.0","source":{"id":"2603.04909","kind":"arxiv","version":2}},"canonical_sha256":"b3fde448ed696e3923b14c7f2e555eedf2d90e0a6958106a0172fe429c081135","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b3fde448ed696e3923b14c7f2e555eedf2d90e0a6958106a0172fe429c081135","first_computed_at":"2026-06-09T02:08:40.549780Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-09T02:08:40.549780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ubRH93Eur/p0mKYTaVhFZSzzL9CFov9fDhBlU7PCvvSBy/F4/GSRAYCNAPUGFZ+52hvbAB9Yxv3ZmIT6oo2wCg==","signature_status":"signed_v1","signed_at":"2026-06-09T02:08:40.550878Z","signed_message":"canonical_sha256_bytes"},"source_id":"2603.04909","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:755177a7a30e901d808c0225c1966c8796c0a9c0f3ffb7aa1fe146d3732b83b5","sha256:aac9d13a181b33f648ee140c6420f0e3f5555b31111b7dc8b85d6e785569bacb"],"state_sha256":"b234eb6b279dca087b63cb9fee6e4d8b4f181447aa66c9c8896405ae7fdc7ca2"}