{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:OG5IEDGZ5W4FJ5QLPCJXCPDUCE","short_pith_number":"pith:OG5IEDGZ","canonical_record":{"source":{"id":"2606.17194","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-15T18:34:02Z","cross_cats_sorted":[],"title_canon_sha256":"244cc56b6cd9dfc73ed0e0ef43271090b675b48cacd293fa618b43910c16b15b","abstract_canon_sha256":"dd6beb46b415746cf89f223a55e7c9c78628d81195283c541fa7a650ffa4222a"},"schema_version":"1.0"},"canonical_sha256":"71ba820cd9edb854f60b7893713c74113334cdfce98f8733cf04f92b45f67c02","source":{"kind":"arxiv","id":"2606.17194","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.17194","created_at":"2026-06-19T16:10:05Z"},{"alias_kind":"arxiv_version","alias_value":"2606.17194v1","created_at":"2026-06-19T16:10:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.17194","created_at":"2026-06-19T16:10:05Z"},{"alias_kind":"pith_short_12","alias_value":"OG5IEDGZ5W4F","created_at":"2026-06-19T16:10:05Z"},{"alias_kind":"pith_short_16","alias_value":"OG5IEDGZ5W4FJ5QL","created_at":"2026-06-19T16:10:05Z"},{"alias_kind":"pith_short_8","alias_value":"OG5IEDGZ","created_at":"2026-06-19T16:10:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:OG5IEDGZ5W4FJ5QLPCJXCPDUCE","target":"record","payload":{"canonical_record":{"source":{"id":"2606.17194","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-15T18:34:02Z","cross_cats_sorted":[],"title_canon_sha256":"244cc56b6cd9dfc73ed0e0ef43271090b675b48cacd293fa618b43910c16b15b","abstract_canon_sha256":"dd6beb46b415746cf89f223a55e7c9c78628d81195283c541fa7a650ffa4222a"},"schema_version":"1.0"},"canonical_sha256":"71ba820cd9edb854f60b7893713c74113334cdfce98f8733cf04f92b45f67c02","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:10:05.574934Z","signature_b64":"ivcxCB6kNTCKL0veL9KKR8mk2CpM2Bo+jtSrfMqiGMpg26CYNTDU1KOsl3EJ9aoLLavTeMkjexUynjww3zPMCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71ba820cd9edb854f60b7893713c74113334cdfce98f8733cf04f92b45f67c02","last_reissued_at":"2026-06-19T16:10:05.574600Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:10:05.574600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.17194","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-06-19T16:10:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lwZy/jE1s+sLj76Rd1gQQf4GmLzkiBFyXFaZm6O1ZK8V4PX7/mJTv7u2YRLtlzNB89ap8fYWCigEwE8i3y8aBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T11:08:06.144398Z"},"content_sha256":"67a9a0e6c46c07adfa6f5bea53598d3671712bcdb17bd1a247c53327894b9061","schema_version":"1.0","event_id":"sha256:67a9a0e6c46c07adfa6f5bea53598d3671712bcdb17bd1a247c53327894b9061"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:OG5IEDGZ5W4FJ5QLPCJXCPDUCE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved bounds for lines and $1$-separated sets in Euclidean Ramsey theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gabriel Currier, Jiaming Zhang, Param Mody, Zehan Xie","submitted_at":"2026-06-15T18:34:02Z","abstract_excerpt":"Let $K$ be a $1$-separated set of diameter at most $R-1$, and let $\\ell_m$ denote a collection of $m$ points on a line, with consecutive points of distance $1$ apart. Conlon and Fox (2019) demonstrated a coloring of $n$-dimensional Euclidean space avoiding red congruent copies of $\\ell_2$ and blue congruent copies of $K$ for $|K| > 10000^n\\log R$. We show here a stronger bound, that in fact $|K| > (11 + o(1))^n\\ln R$ suffices for arbitrary $1$-separated $K$, while the improvement $|K| > (5 + o(1))^n\\ln R$ holds in many cases, including when $K = \\ell_m$, or more generally when $K$ is contained"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.17194","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/2606.17194/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-06-19T16:10:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NVCdEQ0cDWMU8CC3jnUQv+LWN9+tL557D+R144CZL05XGeBm6Z0hcrv0zELFz+cyfmxEFCwUlERcvZ+tQgMgAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T11:08:06.144776Z"},"content_sha256":"bb44427f41588bf4182dd11e61a797a4ff0a91cf08993232906797886dc5e8d5","schema_version":"1.0","event_id":"sha256:bb44427f41588bf4182dd11e61a797a4ff0a91cf08993232906797886dc5e8d5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OG5IEDGZ5W4FJ5QLPCJXCPDUCE/bundle.json","state_url":"https://pith.science/pith/OG5IEDGZ5W4FJ5QLPCJXCPDUCE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OG5IEDGZ5W4FJ5QLPCJXCPDUCE/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-07-06T11:08:06Z","links":{"resolver":"https://pith.science/pith/OG5IEDGZ5W4FJ5QLPCJXCPDUCE","bundle":"https://pith.science/pith/OG5IEDGZ5W4FJ5QLPCJXCPDUCE/bundle.json","state":"https://pith.science/pith/OG5IEDGZ5W4FJ5QLPCJXCPDUCE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OG5IEDGZ5W4FJ5QLPCJXCPDUCE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:OG5IEDGZ5W4FJ5QLPCJXCPDUCE","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":"dd6beb46b415746cf89f223a55e7c9c78628d81195283c541fa7a650ffa4222a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-15T18:34:02Z","title_canon_sha256":"244cc56b6cd9dfc73ed0e0ef43271090b675b48cacd293fa618b43910c16b15b"},"schema_version":"1.0","source":{"id":"2606.17194","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.17194","created_at":"2026-06-19T16:10:05Z"},{"alias_kind":"arxiv_version","alias_value":"2606.17194v1","created_at":"2026-06-19T16:10:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.17194","created_at":"2026-06-19T16:10:05Z"},{"alias_kind":"pith_short_12","alias_value":"OG5IEDGZ5W4F","created_at":"2026-06-19T16:10:05Z"},{"alias_kind":"pith_short_16","alias_value":"OG5IEDGZ5W4FJ5QL","created_at":"2026-06-19T16:10:05Z"},{"alias_kind":"pith_short_8","alias_value":"OG5IEDGZ","created_at":"2026-06-19T16:10:05Z"}],"graph_snapshots":[{"event_id":"sha256:bb44427f41588bf4182dd11e61a797a4ff0a91cf08993232906797886dc5e8d5","target":"graph","created_at":"2026-06-19T16:10:05Z","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/2606.17194/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $K$ be a $1$-separated set of diameter at most $R-1$, and let $\\ell_m$ denote a collection of $m$ points on a line, with consecutive points of distance $1$ apart. Conlon and Fox (2019) demonstrated a coloring of $n$-dimensional Euclidean space avoiding red congruent copies of $\\ell_2$ and blue congruent copies of $K$ for $|K| > 10000^n\\log R$. We show here a stronger bound, that in fact $|K| > (11 + o(1))^n\\ln R$ suffices for arbitrary $1$-separated $K$, while the improvement $|K| > (5 + o(1))^n\\ln R$ holds in many cases, including when $K = \\ell_m$, or more generally when $K$ is contained","authors_text":"Gabriel Currier, Jiaming Zhang, Param Mody, Zehan Xie","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-15T18:34:02Z","title":"Improved bounds for lines and $1$-separated sets in Euclidean Ramsey theory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.17194","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:67a9a0e6c46c07adfa6f5bea53598d3671712bcdb17bd1a247c53327894b9061","target":"record","created_at":"2026-06-19T16:10:05Z","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":"dd6beb46b415746cf89f223a55e7c9c78628d81195283c541fa7a650ffa4222a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-15T18:34:02Z","title_canon_sha256":"244cc56b6cd9dfc73ed0e0ef43271090b675b48cacd293fa618b43910c16b15b"},"schema_version":"1.0","source":{"id":"2606.17194","kind":"arxiv","version":1}},"canonical_sha256":"71ba820cd9edb854f60b7893713c74113334cdfce98f8733cf04f92b45f67c02","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"71ba820cd9edb854f60b7893713c74113334cdfce98f8733cf04f92b45f67c02","first_computed_at":"2026-06-19T16:10:05.574600Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:10:05.574600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ivcxCB6kNTCKL0veL9KKR8mk2CpM2Bo+jtSrfMqiGMpg26CYNTDU1KOsl3EJ9aoLLavTeMkjexUynjww3zPMCw==","signature_status":"signed_v1","signed_at":"2026-06-19T16:10:05.574934Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.17194","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:67a9a0e6c46c07adfa6f5bea53598d3671712bcdb17bd1a247c53327894b9061","sha256:bb44427f41588bf4182dd11e61a797a4ff0a91cf08993232906797886dc5e8d5"],"state_sha256":"a20dca2b2404bc78c82ea400b9377eb4bad6c6600f447e1441e16ab885c287a9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R3jleNlaWnN6bD3T/8U6yyC5seXKxPlFpmLtyF8IoYtOUODvAHyt86yBChPdFgT1lWYR0FmobN5FUOGmMDulCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T11:08:06.146873Z","bundle_sha256":"fa4447e446e4a4a972cf2678cdae3b3970e72418b31842e074251befb5d6278b"}}