{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:M47HI5ZJVZJOBR37S2EE4QFWMC","short_pith_number":"pith:M47HI5ZJ","schema_version":"1.0","canonical_sha256":"673e747729ae52e0c77f96884e40b6608761e29c4c40a0b4e7807959f841ed5d","source":{"kind":"arxiv","id":"1701.02048","version":4},"attestation_state":"computed","paper":{"title":"Some remarks on the lonely runner conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Terence Tao","submitted_at":"2017-01-09T01:29:03Z","abstract_excerpt":"The lonely runner conjecture of Wills and Cusick, in its most popular formulation, asserts that if $n$ runners with distinct constant speeds run around a unit circle ${\\bf R}/{\\bf Z}$ starting at a common time and place, then each runner will at some time be separated by a distance of at least $\\frac{1}{n+1}$ from the others. In this paper we make some remarks on this conjecture. Firstly, we can improve the trivial lower bound of $\\frac{1}{2n}$ slightly for large $n$, to $\\frac{1}{2n} + \\frac{c \\log n}{n^2 (\\log\\log n)^2}$ for some absolute constant $c>0$; previous improvements were roughly of"},"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":"1701.02048","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-09T01:29:03Z","cross_cats_sorted":[],"title_canon_sha256":"dd5736dce1be6215fa63bdaf895c595714c086ba07a7ff046b1dde75e47d26ce","abstract_canon_sha256":"875f18406e77b549064952567ac9f95a6294633cfeeff83d74e22aa35e87354c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:31.434680Z","signature_b64":"wIPNKqeLard3+qfFF+ZO9GFycaMqQeJxHPkIO8Mbdkb0STDIxEmP2I/+0EQqNAHT3OmYsfiEsqBbpCYh5cB7Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"673e747729ae52e0c77f96884e40b6608761e29c4c40a0b4e7807959f841ed5d","last_reissued_at":"2026-05-18T00:31:31.434063Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:31.434063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Some remarks on the lonely runner conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Terence Tao","submitted_at":"2017-01-09T01:29:03Z","abstract_excerpt":"The lonely runner conjecture of Wills and Cusick, in its most popular formulation, asserts that if $n$ runners with distinct constant speeds run around a unit circle ${\\bf R}/{\\bf Z}$ starting at a common time and place, then each runner will at some time be separated by a distance of at least $\\frac{1}{n+1}$ from the others. In this paper we make some remarks on this conjecture. Firstly, we can improve the trivial lower bound of $\\frac{1}{2n}$ slightly for large $n$, to $\\frac{1}{2n} + \\frac{c \\log n}{n^2 (\\log\\log n)^2}$ for some absolute constant $c>0$; previous improvements were roughly of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.02048","kind":"arxiv","version":4},"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":"1701.02048","created_at":"2026-05-18T00:31:31.434154+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.02048v4","created_at":"2026-05-18T00:31:31.434154+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.02048","created_at":"2026-05-18T00:31:31.434154+00:00"},{"alias_kind":"pith_short_12","alias_value":"M47HI5ZJVZJO","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"M47HI5ZJVZJOBR37","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"M47HI5ZJ","created_at":"2026-05-18T12:31:28.150371+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.23575","citing_title":"Non-colliding billiards in the plane","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/M47HI5ZJVZJOBR37S2EE4QFWMC","json":"https://pith.science/pith/M47HI5ZJVZJOBR37S2EE4QFWMC.json","graph_json":"https://pith.science/api/pith-number/M47HI5ZJVZJOBR37S2EE4QFWMC/graph.json","events_json":"https://pith.science/api/pith-number/M47HI5ZJVZJOBR37S2EE4QFWMC/events.json","paper":"https://pith.science/paper/M47HI5ZJ"},"agent_actions":{"view_html":"https://pith.science/pith/M47HI5ZJVZJOBR37S2EE4QFWMC","download_json":"https://pith.science/pith/M47HI5ZJVZJOBR37S2EE4QFWMC.json","view_paper":"https://pith.science/paper/M47HI5ZJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.02048&json=true","fetch_graph":"https://pith.science/api/pith-number/M47HI5ZJVZJOBR37S2EE4QFWMC/graph.json","fetch_events":"https://pith.science/api/pith-number/M47HI5ZJVZJOBR37S2EE4QFWMC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M47HI5ZJVZJOBR37S2EE4QFWMC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M47HI5ZJVZJOBR37S2EE4QFWMC/action/storage_attestation","attest_author":"https://pith.science/pith/M47HI5ZJVZJOBR37S2EE4QFWMC/action/author_attestation","sign_citation":"https://pith.science/pith/M47HI5ZJVZJOBR37S2EE4QFWMC/action/citation_signature","submit_replication":"https://pith.science/pith/M47HI5ZJVZJOBR37S2EE4QFWMC/action/replication_record"}},"created_at":"2026-05-18T00:31:31.434154+00:00","updated_at":"2026-05-18T00:31:31.434154+00:00"}