{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:NCXEROR5LUDIQYAMGLCEMD2VKC","short_pith_number":"pith:NCXEROR5","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"},"canonical_sha256":"68ae48ba3d5d0688600c32c4460f55508cbbbb4afde935ba615f6a078e24336e","source":{"kind":"arxiv","id":"2008.07987","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2008.07987","created_at":"2026-07-05T01:27:57Z"},{"alias_kind":"arxiv_version","alias_value":"2008.07987v1","created_at":"2026-07-05T01:27:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.07987","created_at":"2026-07-05T01:27:57Z"},{"alias_kind":"pith_short_12","alias_value":"NCXEROR5LUDI","created_at":"2026-07-05T01:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"NCXEROR5LUDIQYAM","created_at":"2026-07-05T01:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"NCXEROR5","created_at":"2026-07-05T01:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:NCXEROR5LUDIQYAMGLCEMD2VKC","target":"record","payload":{"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"},"canonical_sha256":"68ae48ba3d5d0688600c32c4460f55508cbbbb4afde935ba615f6a078e24336e","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"},"source_kind":"arxiv","source_id":"2008.07987","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T01:27:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UquStkMglucBxg0bYfR+Sc++GAlY+3Yk/PvLboITAClRpJhrBmc5N9SbR6ROq2pyXf+tCKBSz8oxkvQxg+kGDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T11:43:50.864382Z"},"content_sha256":"414cb785142076fb06b5cacf7993c3c675f6ed4b09be932529a0ae5ba1e5d106","schema_version":"1.0","event_id":"sha256:414cb785142076fb06b5cacf7993c3c675f6ed4b09be932529a0ae5ba1e5d106"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:NCXEROR5LUDIQYAMGLCEMD2VKC","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T01:27:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TMqRwtQPs3ZtbYkfOxDnUy8uXmMRcx3iDN+7JfgUnKvl6zpz1FX6tw6rnctaEtBzD87mu0MrABI5pfPUQEKLBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T11:43:50.865265Z"},"content_sha256":"feaaf5c0b69af173f3e1bb3b7dd95509d333ef42116cf1571bf9846810638b1d","schema_version":"1.0","event_id":"sha256:feaaf5c0b69af173f3e1bb3b7dd95509d333ef42116cf1571bf9846810638b1d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NCXEROR5LUDIQYAMGLCEMD2VKC/bundle.json","state_url":"https://pith.science/pith/NCXEROR5LUDIQYAMGLCEMD2VKC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NCXEROR5LUDIQYAMGLCEMD2VKC/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-16T11:43:50Z","links":{"resolver":"https://pith.science/pith/NCXEROR5LUDIQYAMGLCEMD2VKC","bundle":"https://pith.science/pith/NCXEROR5LUDIQYAMGLCEMD2VKC/bundle.json","state":"https://pith.science/pith/NCXEROR5LUDIQYAMGLCEMD2VKC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NCXEROR5LUDIQYAMGLCEMD2VKC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:NCXEROR5LUDIQYAMGLCEMD2VKC","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"33b05d3e84de71068cfeb5d94a4b5d7a00764a5b9dd85830bdb3ced99014a0b1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-08-18T15:32:44Z","title_canon_sha256":"09616749faca5a72ce6e13d6ba50203f602d0feab032515721399a33e7a0d12b"},"schema_version":"1.0","source":{"id":"2008.07987","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2008.07987","created_at":"2026-07-05T01:27:57Z"},{"alias_kind":"arxiv_version","alias_value":"2008.07987v1","created_at":"2026-07-05T01:27:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.07987","created_at":"2026-07-05T01:27:57Z"},{"alias_kind":"pith_short_12","alias_value":"NCXEROR5LUDI","created_at":"2026-07-05T01:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"NCXEROR5LUDIQYAM","created_at":"2026-07-05T01:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"NCXEROR5","created_at":"2026-07-05T01:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:feaaf5c0b69af173f3e1bb3b7dd95509d333ef42116cf1571bf9846810638b1d","target":"graph","created_at":"2026-07-05T01:27:57Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2008.07987/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Haydn Gwyn, Jacob Stavrianos","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-08-18T15:32:44Z","title":"A Finite Graph Approach to the Probabilistic Hadwiger-Nelson Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.07987","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:414cb785142076fb06b5cacf7993c3c675f6ed4b09be932529a0ae5ba1e5d106","target":"record","created_at":"2026-07-05T01:27:57Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"33b05d3e84de71068cfeb5d94a4b5d7a00764a5b9dd85830bdb3ced99014a0b1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-08-18T15:32:44Z","title_canon_sha256":"09616749faca5a72ce6e13d6ba50203f602d0feab032515721399a33e7a0d12b"},"schema_version":"1.0","source":{"id":"2008.07987","kind":"arxiv","version":1}},"canonical_sha256":"68ae48ba3d5d0688600c32c4460f55508cbbbb4afde935ba615f6a078e24336e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"68ae48ba3d5d0688600c32c4460f55508cbbbb4afde935ba615f6a078e24336e","first_computed_at":"2026-07-05T01:27:57.691212Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:27:57.691212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2/i8tQPKqyZTO/I38lla7AmFAsef+/QWLz+PNwzmJ4hYOvgG1WYeZNVoxS72Ecd+mFMWzXwIpggqrgDG7Z9XCg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:27:57.691561Z","signed_message":"canonical_sha256_bytes"},"source_id":"2008.07987","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:414cb785142076fb06b5cacf7993c3c675f6ed4b09be932529a0ae5ba1e5d106","sha256:feaaf5c0b69af173f3e1bb3b7dd95509d333ef42116cf1571bf9846810638b1d"],"state_sha256":"c0c89f635e72be5029f0c38d09a63779de213476541c3bb73ade2658ff4b18e0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n8TK5aFpa31tx0PRZXya9WhBRXtdEBipnPuJ1ZCY6obZifYOYyVxq/6t5/15/EggxnEm5sxOUeEIrI/BnaXBDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T11:43:50.870638Z","bundle_sha256":"f7ce6a5d71c9f4a16eb03c7e4ca20f00d7664870c7ad20cbf3e825ab5bedb240"}}