{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ZCGBBNSWEPFADOFVY4JPGA6WB4","short_pith_number":"pith:ZCGBBNSW","schema_version":"1.0","canonical_sha256":"c88c10b65623ca01b8b5c712f303d60f2e0c41ba6dae5ca3c1323094b540f078","source":{"kind":"arxiv","id":"1902.08177","version":2},"attestation_state":"computed","paper":{"title":"On the growth rate of chromatic numbers of finite subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.LO","authors_text":"Chris Lambie-Hanson","submitted_at":"2019-02-21T18:37:53Z","abstract_excerpt":"We prove that, for every function $f:\\mathbb{N} \\rightarrow \\mathbb{N}$, there is a graph $G$ with uncountable chromatic number such that, for every $k \\in \\mathbb{N}$ with $k \\geq 3$, every subgraph of $G$ with fewer than $f(k)$ vertices has chromatic number less than $k$. This answers a question of Erd\\H{o}s, Hajnal, and Szemeredi."},"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":"1902.08177","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2019-02-21T18:37:53Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"ee8fa57c1d5fd109f9b4811e8a62fbb0ce826b8cc6b2322345b57d5388e0fd03","abstract_canon_sha256":"86441d7a663ae666c5f55c71d34af97573e7ab630a71964b787320992e5ce718"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:50.710762Z","signature_b64":"s3BHAQtnD6XR9JRqZffltkksHX4uvcUv2I2EiD1GhqJ1cSyVmdELmi8wAx3G6ZNu08CIw+mWhzHNEspTDRG2Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c88c10b65623ca01b8b5c712f303d60f2e0c41ba6dae5ca3c1323094b540f078","last_reissued_at":"2026-05-17T23:52:50.709996Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:50.709996Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the growth rate of chromatic numbers of finite subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.LO","authors_text":"Chris Lambie-Hanson","submitted_at":"2019-02-21T18:37:53Z","abstract_excerpt":"We prove that, for every function $f:\\mathbb{N} \\rightarrow \\mathbb{N}$, there is a graph $G$ with uncountable chromatic number such that, for every $k \\in \\mathbb{N}$ with $k \\geq 3$, every subgraph of $G$ with fewer than $f(k)$ vertices has chromatic number less than $k$. This answers a question of Erd\\H{o}s, Hajnal, and Szemeredi."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.08177","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":""},"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":"1902.08177","created_at":"2026-05-17T23:52:50.710166+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.08177v2","created_at":"2026-05-17T23:52:50.710166+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08177","created_at":"2026-05-17T23:52:50.710166+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZCGBBNSWEPFA","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZCGBBNSWEPFADOFV","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZCGBBNSW","created_at":"2026-05-18T12:33:33.725879+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/ZCGBBNSWEPFADOFVY4JPGA6WB4","json":"https://pith.science/pith/ZCGBBNSWEPFADOFVY4JPGA6WB4.json","graph_json":"https://pith.science/api/pith-number/ZCGBBNSWEPFADOFVY4JPGA6WB4/graph.json","events_json":"https://pith.science/api/pith-number/ZCGBBNSWEPFADOFVY4JPGA6WB4/events.json","paper":"https://pith.science/paper/ZCGBBNSW"},"agent_actions":{"view_html":"https://pith.science/pith/ZCGBBNSWEPFADOFVY4JPGA6WB4","download_json":"https://pith.science/pith/ZCGBBNSWEPFADOFVY4JPGA6WB4.json","view_paper":"https://pith.science/paper/ZCGBBNSW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.08177&json=true","fetch_graph":"https://pith.science/api/pith-number/ZCGBBNSWEPFADOFVY4JPGA6WB4/graph.json","fetch_events":"https://pith.science/api/pith-number/ZCGBBNSWEPFADOFVY4JPGA6WB4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZCGBBNSWEPFADOFVY4JPGA6WB4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZCGBBNSWEPFADOFVY4JPGA6WB4/action/storage_attestation","attest_author":"https://pith.science/pith/ZCGBBNSWEPFADOFVY4JPGA6WB4/action/author_attestation","sign_citation":"https://pith.science/pith/ZCGBBNSWEPFADOFVY4JPGA6WB4/action/citation_signature","submit_replication":"https://pith.science/pith/ZCGBBNSWEPFADOFVY4JPGA6WB4/action/replication_record"}},"created_at":"2026-05-17T23:52:50.710166+00:00","updated_at":"2026-05-17T23:52:50.710166+00:00"}