{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:V34S4JOLTDWEKMW7CEBM3ZADOP","short_pith_number":"pith:V34S4JOL","schema_version":"1.0","canonical_sha256":"aef92e25cb98ec4532df1102cde40373c7a69e56c02d2da441b7c94b54f37571","source":{"kind":"arxiv","id":"1606.01783","version":4},"attestation_state":"computed","paper":{"title":"Lonely Runner Polyhedra","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Matthias Beck, Matthias Schymura, Serkan Hosten","submitted_at":"2016-06-06T15:16:12Z","abstract_excerpt":"We study the \\emph{Lonely Runner Conjecture}, conceived by J\\\"org M.~Wills in the 1960's: Given positive integers $n_1, n_2, \\dots, n_k$, there exists a positive real number $t$ such that for all $1 \\le j \\le k$ the distance of $t \\, n_j$ to the nearest integer is at least $\\frac{ 1 }{ k+1 }$. Continuing a view-obstruction approach by Cusick and recent work by Henze and Malikiosis, our goal is to promote a polyhedral \\emph{ansatz} to the Lonely Runner Conjecture. Our results include geometric proofs of some folklore results that are only implicit in the existing literature, a new family of aff"},"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":"1606.01783","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-06T15:16:12Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"dc2deaf5b9dd772189dacd4c1f4345f0353f79a339e5a6bbcab4266ec5e7c848","abstract_canon_sha256":"a0dc0d2411b5d2ac2cd7feccd94e34a0e8b460b81122b8c4ee2f0465eb0f6019"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:28:42.792084Z","signature_b64":"A6A92HAbdprt9hb8adpW05sKDleLk7yJbmEp5AIK5ZpO0KgpsqZSx9tZ6SC+iYMtVukuXpYMhps0b/NAIdPKDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aef92e25cb98ec4532df1102cde40373c7a69e56c02d2da441b7c94b54f37571","last_reissued_at":"2026-07-05T00:28:42.791588Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:28:42.791588Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lonely Runner Polyhedra","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Matthias Beck, Matthias Schymura, Serkan Hosten","submitted_at":"2016-06-06T15:16:12Z","abstract_excerpt":"We study the \\emph{Lonely Runner Conjecture}, conceived by J\\\"org M.~Wills in the 1960's: Given positive integers $n_1, n_2, \\dots, n_k$, there exists a positive real number $t$ such that for all $1 \\le j \\le k$ the distance of $t \\, n_j$ to the nearest integer is at least $\\frac{ 1 }{ k+1 }$. Continuing a view-obstruction approach by Cusick and recent work by Henze and Malikiosis, our goal is to promote a polyhedral \\emph{ansatz} to the Lonely Runner Conjecture. Our results include geometric proofs of some folklore results that are only implicit in the existing literature, a new family of aff"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.01783","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1606.01783/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":"1606.01783","created_at":"2026-07-05T00:28:42.791654+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.01783v4","created_at":"2026-07-05T00:28:42.791654+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.01783","created_at":"2026-07-05T00:28:42.791654+00:00"},{"alias_kind":"pith_short_12","alias_value":"V34S4JOLTDWE","created_at":"2026-07-05T00:28:42.791654+00:00"},{"alias_kind":"pith_short_16","alias_value":"V34S4JOLTDWEKMW7","created_at":"2026-07-05T00:28:42.791654+00:00"},{"alias_kind":"pith_short_8","alias_value":"V34S4JOL","created_at":"2026-07-05T00:28:42.791654+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/V34S4JOLTDWEKMW7CEBM3ZADOP","json":"https://pith.science/pith/V34S4JOLTDWEKMW7CEBM3ZADOP.json","graph_json":"https://pith.science/api/pith-number/V34S4JOLTDWEKMW7CEBM3ZADOP/graph.json","events_json":"https://pith.science/api/pith-number/V34S4JOLTDWEKMW7CEBM3ZADOP/events.json","paper":"https://pith.science/paper/V34S4JOL"},"agent_actions":{"view_html":"https://pith.science/pith/V34S4JOLTDWEKMW7CEBM3ZADOP","download_json":"https://pith.science/pith/V34S4JOLTDWEKMW7CEBM3ZADOP.json","view_paper":"https://pith.science/paper/V34S4JOL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.01783&json=true","fetch_graph":"https://pith.science/api/pith-number/V34S4JOLTDWEKMW7CEBM3ZADOP/graph.json","fetch_events":"https://pith.science/api/pith-number/V34S4JOLTDWEKMW7CEBM3ZADOP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V34S4JOLTDWEKMW7CEBM3ZADOP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V34S4JOLTDWEKMW7CEBM3ZADOP/action/storage_attestation","attest_author":"https://pith.science/pith/V34S4JOLTDWEKMW7CEBM3ZADOP/action/author_attestation","sign_citation":"https://pith.science/pith/V34S4JOLTDWEKMW7CEBM3ZADOP/action/citation_signature","submit_replication":"https://pith.science/pith/V34S4JOLTDWEKMW7CEBM3ZADOP/action/replication_record"}},"created_at":"2026-07-05T00:28:42.791654+00:00","updated_at":"2026-07-05T00:28:42.791654+00:00"}