{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:33YZOPBSRTRC65YR6CJ72DP6JO","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":"6f2a1274e2971a2c77dcfea13a381215ded71d337a222fd136db8e48495b86ea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-03-10T21:03:37Z","title_canon_sha256":"9b2e988f49fc86a540fab35322284cf42409f08d4fffcb39491602749e95dcc3"},"schema_version":"1.0","source":{"id":"2003.04990","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2003.04990","created_at":"2026-07-05T00:47:20Z"},{"alias_kind":"arxiv_version","alias_value":"2003.04990v1","created_at":"2026-07-05T00:47:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.04990","created_at":"2026-07-05T00:47:20Z"},{"alias_kind":"pith_short_12","alias_value":"33YZOPBSRTRC","created_at":"2026-07-05T00:47:20Z"},{"alias_kind":"pith_short_16","alias_value":"33YZOPBSRTRC65YR","created_at":"2026-07-05T00:47:20Z"},{"alias_kind":"pith_short_8","alias_value":"33YZOPBS","created_at":"2026-07-05T00:47:20Z"}],"graph_snapshots":[{"event_id":"sha256:1c668a8ac6ab8ab1224521c09806d9b04f02b89b2e4a012462087d93395ca1f6","target":"graph","created_at":"2026-07-05T00:47:20Z","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/2003.04990/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Recently, Farnik asked whether the hat guessing number $\\text{HG}(G)$ of a graph $G$ could be bounded as a function of its degeneracy $d$, and Bosek, Dudek, Farnik, Grytczuk and Mazur showed that $\\text{HG}(G)\\ge 2^d$ is possible. We show that for all $d\\ge 1$ there exists a $d$-degenerate graph $G$ for which $\\text{HG}(G) \\ge 2^{2^{d-1}}$. We also give a new general method for obtaining upper bounds on $\\text{HG}(G)$. The question of whether $\\text{HG}(G)$ is bounded as a function of $d$ remains open.","authors_text":"Ray Li, Xiaoyu He","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-03-10T21:03:37Z","title":"Hat Guessing Numbers of Degenerate Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.04990","kind":"arxiv","version":1},"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:6d2a1d1a51396732dd5e470b956f7603c49457c246bc5f749b37f9e478c4f620","target":"record","created_at":"2026-07-05T00:47:20Z","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":"6f2a1274e2971a2c77dcfea13a381215ded71d337a222fd136db8e48495b86ea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-03-10T21:03:37Z","title_canon_sha256":"9b2e988f49fc86a540fab35322284cf42409f08d4fffcb39491602749e95dcc3"},"schema_version":"1.0","source":{"id":"2003.04990","kind":"arxiv","version":1}},"canonical_sha256":"def1973c328ce22f7711f093fd0dfe4bbbe35a8cc07f94af885cd9d70c671b9b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"def1973c328ce22f7711f093fd0dfe4bbbe35a8cc07f94af885cd9d70c671b9b","first_computed_at":"2026-07-05T00:47:20.104904Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:47:20.104904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"envUWQdyGGhfLSJHClpzZr7uwN2Mj/QnrtfuzIoGmlIzsA4JF0G3AtrvvovpTEj4Ry6YEvTgcL9v9QGY+B5BBA==","signature_status":"signed_v1","signed_at":"2026-07-05T00:47:20.105337Z","signed_message":"canonical_sha256_bytes"},"source_id":"2003.04990","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6d2a1d1a51396732dd5e470b956f7603c49457c246bc5f749b37f9e478c4f620","sha256:1c668a8ac6ab8ab1224521c09806d9b04f02b89b2e4a012462087d93395ca1f6"],"state_sha256":"c90adfa5fd85780e9f344de417b296c824c49e64f230e86d1e11a306a4adffbf"}