{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:NCXEROR5LUDIQYAMGLCEMD2VKC","short_pith_number":"pith:NCXEROR5","schema_version":"1.0","canonical_sha256":"68ae48ba3d5d0688600c32c4460f55508cbbbb4afde935ba615f6a078e24336e","source":{"kind":"arxiv","id":"2008.07987","version":1},"attestation_state":"computed","paper":{"title":"A Finite Graph Approach to the Probabilistic Hadwiger-Nelson Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Haydn Gwyn, Jacob Stavrianos","submitted_at":"2020-08-18T15:32:44Z","abstract_excerpt":"We advance a probabilistic approach to the Hadwiger-Nelson problem initially developed by the Polymath16 project, in particular relating the approach to finite unit-distance graphs. We define the numerical \\textit{badness} of a given $k$-coloring of the plane to be the probability that a randomly chosen unit-distance edge is monochromatic under the coloring, and we provide lower bounds on the badness of arbitrary $k$-colorings using a probabilistic technique relating to finite graphs. The contrapositive of the resulting bounds lets us compute lower bounds on the order of non $k$-colorable unit"},"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":"2008.07987","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-08-18T15:32:44Z","cross_cats_sorted":[],"title_canon_sha256":"09616749faca5a72ce6e13d6ba50203f602d0feab032515721399a33e7a0d12b","abstract_canon_sha256":"33b05d3e84de71068cfeb5d94a4b5d7a00764a5b9dd85830bdb3ced99014a0b1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:27:57.691561Z","signature_b64":"2/i8tQPKqyZTO/I38lla7AmFAsef+/QWLz+PNwzmJ4hYOvgG1WYeZNVoxS72Ecd+mFMWzXwIpggqrgDG7Z9XCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68ae48ba3d5d0688600c32c4460f55508cbbbb4afde935ba615f6a078e24336e","last_reissued_at":"2026-07-05T01:27:57.691212Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:27:57.691212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Finite Graph Approach to the Probabilistic Hadwiger-Nelson Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Haydn Gwyn, Jacob Stavrianos","submitted_at":"2020-08-18T15:32:44Z","abstract_excerpt":"We advance a probabilistic approach to the Hadwiger-Nelson problem initially developed by the Polymath16 project, in particular relating the approach to finite unit-distance graphs. We define the numerical \\textit{badness} of a given $k$-coloring of the plane to be the probability that a randomly chosen unit-distance edge is monochromatic under the coloring, and we provide lower bounds on the badness of arbitrary $k$-colorings using a probabilistic technique relating to finite graphs. The contrapositive of the resulting bounds lets us compute lower bounds on the order of non $k$-colorable unit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.07987","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/2008.07987/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":"2008.07987","created_at":"2026-07-05T01:27:57.691269+00:00"},{"alias_kind":"arxiv_version","alias_value":"2008.07987v1","created_at":"2026-07-05T01:27:57.691269+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.07987","created_at":"2026-07-05T01:27:57.691269+00:00"},{"alias_kind":"pith_short_12","alias_value":"NCXEROR5LUDI","created_at":"2026-07-05T01:27:57.691269+00:00"},{"alias_kind":"pith_short_16","alias_value":"NCXEROR5LUDIQYAM","created_at":"2026-07-05T01:27:57.691269+00:00"},{"alias_kind":"pith_short_8","alias_value":"NCXEROR5","created_at":"2026-07-05T01:27:57.691269+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.18527","citing_title":"Neural Discovery in Mathematics: Do Machines Dream of Colored Planes?","ref_index":21,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NCXEROR5LUDIQYAMGLCEMD2VKC","json":"https://pith.science/pith/NCXEROR5LUDIQYAMGLCEMD2VKC.json","graph_json":"https://pith.science/api/pith-number/NCXEROR5LUDIQYAMGLCEMD2VKC/graph.json","events_json":"https://pith.science/api/pith-number/NCXEROR5LUDIQYAMGLCEMD2VKC/events.json","paper":"https://pith.science/paper/NCXEROR5"},"agent_actions":{"view_html":"https://pith.science/pith/NCXEROR5LUDIQYAMGLCEMD2VKC","download_json":"https://pith.science/pith/NCXEROR5LUDIQYAMGLCEMD2VKC.json","view_paper":"https://pith.science/paper/NCXEROR5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2008.07987&json=true","fetch_graph":"https://pith.science/api/pith-number/NCXEROR5LUDIQYAMGLCEMD2VKC/graph.json","fetch_events":"https://pith.science/api/pith-number/NCXEROR5LUDIQYAMGLCEMD2VKC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NCXEROR5LUDIQYAMGLCEMD2VKC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NCXEROR5LUDIQYAMGLCEMD2VKC/action/storage_attestation","attest_author":"https://pith.science/pith/NCXEROR5LUDIQYAMGLCEMD2VKC/action/author_attestation","sign_citation":"https://pith.science/pith/NCXEROR5LUDIQYAMGLCEMD2VKC/action/citation_signature","submit_replication":"https://pith.science/pith/NCXEROR5LUDIQYAMGLCEMD2VKC/action/replication_record"}},"created_at":"2026-07-05T01:27:57.691269+00:00","updated_at":"2026-07-05T01:27:57.691269+00:00"}