{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:33YZOPBSRTRC65YR6CJ72DP6JO","short_pith_number":"pith:33YZOPBS","schema_version":"1.0","canonical_sha256":"def1973c328ce22f7711f093fd0dfe4bbbe35a8cc07f94af885cd9d70c671b9b","source":{"kind":"arxiv","id":"2003.04990","version":1},"attestation_state":"computed","paper":{"title":"Hat Guessing Numbers of Degenerate Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ray Li, Xiaoyu He","submitted_at":"2020-03-10T21:03:37Z","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."},"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":"2003.04990","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-03-10T21:03:37Z","cross_cats_sorted":[],"title_canon_sha256":"9b2e988f49fc86a540fab35322284cf42409f08d4fffcb39491602749e95dcc3","abstract_canon_sha256":"6f2a1274e2971a2c77dcfea13a381215ded71d337a222fd136db8e48495b86ea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:47:20.105337Z","signature_b64":"envUWQdyGGhfLSJHClpzZr7uwN2Mj/QnrtfuzIoGmlIzsA4JF0G3AtrvvovpTEj4Ry6YEvTgcL9v9QGY+B5BBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"def1973c328ce22f7711f093fd0dfe4bbbe35a8cc07f94af885cd9d70c671b9b","last_reissued_at":"2026-07-05T00:47:20.104904Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:47:20.104904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hat Guessing Numbers of Degenerate Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ray Li, Xiaoyu He","submitted_at":"2020-03-10T21:03:37Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.04990","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2003.04990/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":"2003.04990","created_at":"2026-07-05T00:47:20.104959+00:00"},{"alias_kind":"arxiv_version","alias_value":"2003.04990v1","created_at":"2026-07-05T00:47:20.104959+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.04990","created_at":"2026-07-05T00:47:20.104959+00:00"},{"alias_kind":"pith_short_12","alias_value":"33YZOPBSRTRC","created_at":"2026-07-05T00:47:20.104959+00:00"},{"alias_kind":"pith_short_16","alias_value":"33YZOPBSRTRC65YR","created_at":"2026-07-05T00:47:20.104959+00:00"},{"alias_kind":"pith_short_8","alias_value":"33YZOPBS","created_at":"2026-07-05T00:47:20.104959+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/33YZOPBSRTRC65YR6CJ72DP6JO","json":"https://pith.science/pith/33YZOPBSRTRC65YR6CJ72DP6JO.json","graph_json":"https://pith.science/api/pith-number/33YZOPBSRTRC65YR6CJ72DP6JO/graph.json","events_json":"https://pith.science/api/pith-number/33YZOPBSRTRC65YR6CJ72DP6JO/events.json","paper":"https://pith.science/paper/33YZOPBS"},"agent_actions":{"view_html":"https://pith.science/pith/33YZOPBSRTRC65YR6CJ72DP6JO","download_json":"https://pith.science/pith/33YZOPBSRTRC65YR6CJ72DP6JO.json","view_paper":"https://pith.science/paper/33YZOPBS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2003.04990&json=true","fetch_graph":"https://pith.science/api/pith-number/33YZOPBSRTRC65YR6CJ72DP6JO/graph.json","fetch_events":"https://pith.science/api/pith-number/33YZOPBSRTRC65YR6CJ72DP6JO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/33YZOPBSRTRC65YR6CJ72DP6JO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/33YZOPBSRTRC65YR6CJ72DP6JO/action/storage_attestation","attest_author":"https://pith.science/pith/33YZOPBSRTRC65YR6CJ72DP6JO/action/author_attestation","sign_citation":"https://pith.science/pith/33YZOPBSRTRC65YR6CJ72DP6JO/action/citation_signature","submit_replication":"https://pith.science/pith/33YZOPBSRTRC65YR6CJ72DP6JO/action/replication_record"}},"created_at":"2026-07-05T00:47:20.104959+00:00","updated_at":"2026-07-05T00:47:20.104959+00:00"}