{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:K65YPLWMQ6DL5DHWAO4WZWXDAJ","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":"aa383c01380ab923439498929b7056fd941308ffd3a326e72aea9353403ffcfd","cross_cats_sorted":["math.NT"],"license":"","primary_cat":"math.CO","submitted_at":"2007-06-01T21:39:34Z","title_canon_sha256":"63dde67ddcf707351029a039e8ea299313107d1a6ae57981fdcc464e46ae646b"},"schema_version":"1.0","source":{"id":"0706.0223","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0706.0223","created_at":"2026-05-18T02:58:12Z"},{"alias_kind":"arxiv_version","alias_value":"0706.0223v1","created_at":"2026-05-18T02:58:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0706.0223","created_at":"2026-05-18T02:58:12Z"},{"alias_kind":"pith_short_12","alias_value":"K65YPLWMQ6DL","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"K65YPLWMQ6DL5DHW","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"K65YPLWM","created_at":"2026-05-18T12:25:55Z"}],"graph_snapshots":[{"event_id":"sha256:2a58aa5575ea82bda38691d4bc07c6b484cfc9131960dc0a368ea7e9c830ac62","target":"graph","created_at":"2026-05-18T02:58:12Z","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"},"paper":{"abstract_excerpt":"Let ${n_k}$ be an increasing lacunary sequence, i.e., $n_{k+1}/n_k>1+r$ for some $r>0$. In 1987, P. Erdos asked for the chromatic number of a graph $G$ on the integers, where two integers $a,b$ are connected by an edge iff their difference $|a-b|$ is in the sequence ${n_k}$. Y. Katznelson found a connection to a Diophantine approximation problem (also due to Erdos): the existence of $x$ in $(0,1)$ such that all the multiples $n_j x$ are at least distance $\\delta(x)>0$ from the set of integers. Katznelson bounded the chromatic number of $G$ by $Cr^{-2}|\\log r|$. We apply the Lov\\'asz local lemm","authors_text":"Wilhelm Schlag, Yuval Peres","cross_cats":["math.NT"],"headline":"","license":"","primary_cat":"math.CO","submitted_at":"2007-06-01T21:39:34Z","title":"Two Erdos problems on lacunary sequences: Chromatic number and Diophantine approximation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0706.0223","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:d1315b72d92165a1b1be81b5c0e2a2c6af08911fa0c5c4cb60a7dbbd14b272c4","target":"record","created_at":"2026-05-18T02:58:12Z","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":"aa383c01380ab923439498929b7056fd941308ffd3a326e72aea9353403ffcfd","cross_cats_sorted":["math.NT"],"license":"","primary_cat":"math.CO","submitted_at":"2007-06-01T21:39:34Z","title_canon_sha256":"63dde67ddcf707351029a039e8ea299313107d1a6ae57981fdcc464e46ae646b"},"schema_version":"1.0","source":{"id":"0706.0223","kind":"arxiv","version":1}},"canonical_sha256":"57bb87aecc8786be8cf603b96cdae3025a7399634c9d212702d71c620f65e482","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"57bb87aecc8786be8cf603b96cdae3025a7399634c9d212702d71c620f65e482","first_computed_at":"2026-05-18T02:58:12.673107Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:58:12.673107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TIAmCi5JJzewU3obpwE+9GHNEo1PEjLiEQNrl3OJytLK4YaWGiGoGuWDH1U0RfwWIpIl+Eu9NXk4lE4lqVNXCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:58:12.673912Z","signed_message":"canonical_sha256_bytes"},"source_id":"0706.0223","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d1315b72d92165a1b1be81b5c0e2a2c6af08911fa0c5c4cb60a7dbbd14b272c4","sha256:2a58aa5575ea82bda38691d4bc07c6b484cfc9131960dc0a368ea7e9c830ac62"],"state_sha256":"41a842f6aa0eccf61f8ba9575677d786c47334bfe3f6131f6451b42b8bafcbe4"}