{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:EEAW2DWFNDHWTHT7MEG2LBUSAT","short_pith_number":"pith:EEAW2DWF","schema_version":"1.0","canonical_sha256":"21016d0ec568cf699e7f610da5869204e7cd1c689e3292bf3baf0897d5e6f41b","source":{"kind":"arxiv","id":"1805.06055","version":1},"attestation_state":"computed","paper":{"title":"The Hadwiger-Nelson problem with two forbidden distances","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dan Ismailescu, Geoffrey Exoo","submitted_at":"2018-05-15T22:32:23Z","abstract_excerpt":"In 1950 Edward Nelson asked the following simple-sounding question:\n  \\emph{How many colors are needed to color the Euclidean plane $\\mathbb{E}^2$ such that no two points distance $1$ apart are identically colored?}\n  We say that $1$ is a \\emph{forbidden} distance. For many years, we only knew that the answer was $4$, $5$, $6$, or $7$. In a recent breakthrough, de Grey \\cite{degrey} proved that at least five colors are necessary.\n  In this paper we consider a related problem in which we require \\emph{two} forbidden distances, $1$ and $d$. In other words, for a given positive number $d\\neq 1$, "},"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":"1805.06055","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-15T22:32:23Z","cross_cats_sorted":[],"title_canon_sha256":"03c3c972932bf10564a538a7abb7a4b7b490c25fa6261fb982ddc9096135be82","abstract_canon_sha256":"44d7d4c9f41aa5a3b6a1f7c244db938195944a707f7803b8cc816748d4ba7008"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:49.028440Z","signature_b64":"AdeHckfCKC+5/ukLTJcU3zN72qPCJ9v1nMH8s2a50vqXcUoWr2UFFdaVuiS4VfQRz8CuX4ydGewVXeqak5hcDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21016d0ec568cf699e7f610da5869204e7cd1c689e3292bf3baf0897d5e6f41b","last_reissued_at":"2026-05-18T00:15:49.027742Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:49.027742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Hadwiger-Nelson problem with two forbidden distances","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dan Ismailescu, Geoffrey Exoo","submitted_at":"2018-05-15T22:32:23Z","abstract_excerpt":"In 1950 Edward Nelson asked the following simple-sounding question:\n  \\emph{How many colors are needed to color the Euclidean plane $\\mathbb{E}^2$ such that no two points distance $1$ apart are identically colored?}\n  We say that $1$ is a \\emph{forbidden} distance. For many years, we only knew that the answer was $4$, $5$, $6$, or $7$. In a recent breakthrough, de Grey \\cite{degrey} proved that at least five colors are necessary.\n  In this paper we consider a related problem in which we require \\emph{two} forbidden distances, $1$ and $d$. In other words, for a given positive number $d\\neq 1$, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.06055","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":"1805.06055","created_at":"2026-05-18T00:15:49.027860+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.06055v1","created_at":"2026-05-18T00:15:49.027860+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.06055","created_at":"2026-05-18T00:15:49.027860+00:00"},{"alias_kind":"pith_short_12","alias_value":"EEAW2DWFNDHW","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"EEAW2DWFNDHWTHT7","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"EEAW2DWF","created_at":"2026-05-18T12:32:22.470017+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/EEAW2DWFNDHWTHT7MEG2LBUSAT","json":"https://pith.science/pith/EEAW2DWFNDHWTHT7MEG2LBUSAT.json","graph_json":"https://pith.science/api/pith-number/EEAW2DWFNDHWTHT7MEG2LBUSAT/graph.json","events_json":"https://pith.science/api/pith-number/EEAW2DWFNDHWTHT7MEG2LBUSAT/events.json","paper":"https://pith.science/paper/EEAW2DWF"},"agent_actions":{"view_html":"https://pith.science/pith/EEAW2DWFNDHWTHT7MEG2LBUSAT","download_json":"https://pith.science/pith/EEAW2DWFNDHWTHT7MEG2LBUSAT.json","view_paper":"https://pith.science/paper/EEAW2DWF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.06055&json=true","fetch_graph":"https://pith.science/api/pith-number/EEAW2DWFNDHWTHT7MEG2LBUSAT/graph.json","fetch_events":"https://pith.science/api/pith-number/EEAW2DWFNDHWTHT7MEG2LBUSAT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EEAW2DWFNDHWTHT7MEG2LBUSAT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EEAW2DWFNDHWTHT7MEG2LBUSAT/action/storage_attestation","attest_author":"https://pith.science/pith/EEAW2DWFNDHWTHT7MEG2LBUSAT/action/author_attestation","sign_citation":"https://pith.science/pith/EEAW2DWFNDHWTHT7MEG2LBUSAT/action/citation_signature","submit_replication":"https://pith.science/pith/EEAW2DWFNDHWTHT7MEG2LBUSAT/action/replication_record"}},"created_at":"2026-05-18T00:15:49.027860+00:00","updated_at":"2026-05-18T00:15:49.027860+00:00"}