{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:IYPVNE6F7JWSUOKIRF3AGWIB65","short_pith_number":"pith:IYPVNE6F","schema_version":"1.0","canonical_sha256":"461f5693c5fa6d2a39488976035901f7589deaf4687312b8650773f08b4326de","source":{"kind":"arxiv","id":"1708.01081","version":1},"attestation_state":"computed","paper":{"title":"Lower bounds for the measurable chromatic number of the hyperbolic plane","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"math.CO","authors_text":"Evan DeCorte, Konstantin Golubev","submitted_at":"2017-08-03T09:53:14Z","abstract_excerpt":"Consider the graph $\\mathbb{H}(d)$ whose vertex set is the hyperbolic plane, where two points are connected with an edge when their distance is equal to some $d>0$. Asking for the chromatic number of this graph is the hyperbolic analogue to the famous Hadwiger-Nelson problem about colouring the points of the Euclidean plane so that points at distance $1$ receive different colours.\n  As in the Euclidean case, one can lower bound the chromatic number of $\\mathbb{H}(d)$ by $4$ for all $d$. Using spectral methods, we prove that if the colour classes are measurable, then at least $6$ colours are ar"},"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":"1708.01081","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-03T09:53:14Z","cross_cats_sorted":["math.MG"],"title_canon_sha256":"4b45ec1fe34d040d5b93d79b290ace83c1868ffa1617f99e3e30b32890501ca8","abstract_canon_sha256":"98113959e8fae322da5302975e68fe925c6f6541f1e3ec416c90b55ba5c42c50"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:32.968502Z","signature_b64":"q1uKZdIQy0eXMQwndmbr1Q0N4G02/gTq5fCGWo8jAafyJHsZJVL/jIt9q0yjcekQgGkLQUL6CsAXzlpDX3Z8Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"461f5693c5fa6d2a39488976035901f7589deaf4687312b8650773f08b4326de","last_reissued_at":"2026-05-17T23:44:32.967902Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:32.967902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower bounds for the measurable chromatic number of the hyperbolic plane","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"math.CO","authors_text":"Evan DeCorte, Konstantin Golubev","submitted_at":"2017-08-03T09:53:14Z","abstract_excerpt":"Consider the graph $\\mathbb{H}(d)$ whose vertex set is the hyperbolic plane, where two points are connected with an edge when their distance is equal to some $d>0$. Asking for the chromatic number of this graph is the hyperbolic analogue to the famous Hadwiger-Nelson problem about colouring the points of the Euclidean plane so that points at distance $1$ receive different colours.\n  As in the Euclidean case, one can lower bound the chromatic number of $\\mathbb{H}(d)$ by $4$ for all $d$. Using spectral methods, we prove that if the colour classes are measurable, then at least $6$ colours are ar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.01081","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":""},"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":"1708.01081","created_at":"2026-05-17T23:44:32.967988+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.01081v1","created_at":"2026-05-17T23:44:32.967988+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01081","created_at":"2026-05-17T23:44:32.967988+00:00"},{"alias_kind":"pith_short_12","alias_value":"IYPVNE6F7JWS","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"IYPVNE6F7JWSUOKI","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"IYPVNE6F","created_at":"2026-05-18T12:31:21.493067+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/IYPVNE6F7JWSUOKIRF3AGWIB65","json":"https://pith.science/pith/IYPVNE6F7JWSUOKIRF3AGWIB65.json","graph_json":"https://pith.science/api/pith-number/IYPVNE6F7JWSUOKIRF3AGWIB65/graph.json","events_json":"https://pith.science/api/pith-number/IYPVNE6F7JWSUOKIRF3AGWIB65/events.json","paper":"https://pith.science/paper/IYPVNE6F"},"agent_actions":{"view_html":"https://pith.science/pith/IYPVNE6F7JWSUOKIRF3AGWIB65","download_json":"https://pith.science/pith/IYPVNE6F7JWSUOKIRF3AGWIB65.json","view_paper":"https://pith.science/paper/IYPVNE6F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.01081&json=true","fetch_graph":"https://pith.science/api/pith-number/IYPVNE6F7JWSUOKIRF3AGWIB65/graph.json","fetch_events":"https://pith.science/api/pith-number/IYPVNE6F7JWSUOKIRF3AGWIB65/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IYPVNE6F7JWSUOKIRF3AGWIB65/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IYPVNE6F7JWSUOKIRF3AGWIB65/action/storage_attestation","attest_author":"https://pith.science/pith/IYPVNE6F7JWSUOKIRF3AGWIB65/action/author_attestation","sign_citation":"https://pith.science/pith/IYPVNE6F7JWSUOKIRF3AGWIB65/action/citation_signature","submit_replication":"https://pith.science/pith/IYPVNE6F7JWSUOKIRF3AGWIB65/action/replication_record"}},"created_at":"2026-05-17T23:44:32.967988+00:00","updated_at":"2026-05-17T23:44:32.967988+00:00"}