{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:LFXMDLKZTX72PR2W2ANM44GE4E","short_pith_number":"pith:LFXMDLKZ","schema_version":"1.0","canonical_sha256":"596ec1ad599dffa7c756d01ace70c4e12718faf8182c2c65555324eeca6364ae","source":{"kind":"arxiv","id":"2502.00176","version":1},"attestation_state":"computed","paper":{"title":"Settling the no-$(k+1)$-in-line problem when $k$ is not small","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benedek Kov\\'acs, D\\'avid R. Szab\\'o, Zolt\\'an L\\'or\\'ant Nagy","submitted_at":"2025-01-31T21:40:16Z","abstract_excerpt":"What is the maximum number of points that can be selected from an $n \\times n$ square lattice such that no $k+1$ of them are in a line? This has been asked more than $100$ years ago for $k=2$ and it remained wide open ever since. In this paper, we prove the precise answer is $kn$, provided that $k>C\\sqrt{n\\log{n}}$ for an absolute constant $C$. The proof relies on carefully constructed bi-uniform random bipartite graphs and concentration inequalities."},"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":"2502.00176","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-01-31T21:40:16Z","cross_cats_sorted":[],"title_canon_sha256":"057ba86284fc5e88b5275edd4e2adc927d4ffd9c9a7ceab17278084e317e0908","abstract_canon_sha256":"9c39b4d4c63c8711792e63a0497683d5a6fb1a8e6212d26647e794c83aa676b0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:08:30.265013Z","signature_b64":"l0UjAorYbuKHCjBRHk4u9ErWJW0kYHvmQfcipA8ESThNyHxYgJ5trGbX3nKOIYQCmHom1KmQI5TeptZGs8VmBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"596ec1ad599dffa7c756d01ace70c4e12718faf8182c2c65555324eeca6364ae","last_reissued_at":"2026-07-05T10:08:30.264620Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:08:30.264620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Settling the no-$(k+1)$-in-line problem when $k$ is not small","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benedek Kov\\'acs, D\\'avid R. Szab\\'o, Zolt\\'an L\\'or\\'ant Nagy","submitted_at":"2025-01-31T21:40:16Z","abstract_excerpt":"What is the maximum number of points that can be selected from an $n \\times n$ square lattice such that no $k+1$ of them are in a line? This has been asked more than $100$ years ago for $k=2$ and it remained wide open ever since. In this paper, we prove the precise answer is $kn$, provided that $k>C\\sqrt{n\\log{n}}$ for an absolute constant $C$. The proof relies on carefully constructed bi-uniform random bipartite graphs and concentration inequalities."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.00176","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/2502.00176/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":"2502.00176","created_at":"2026-07-05T10:08:30.264679+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.00176v1","created_at":"2026-07-05T10:08:30.264679+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.00176","created_at":"2026-07-05T10:08:30.264679+00:00"},{"alias_kind":"pith_short_12","alias_value":"LFXMDLKZTX72","created_at":"2026-07-05T10:08:30.264679+00:00"},{"alias_kind":"pith_short_16","alias_value":"LFXMDLKZTX72PR2W","created_at":"2026-07-05T10:08:30.264679+00:00"},{"alias_kind":"pith_short_8","alias_value":"LFXMDLKZ","created_at":"2026-07-05T10:08:30.264679+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.05255","citing_title":"No-$(k+1)$-in-line problem for $k \\geqslant 3$","ref_index":27,"is_internal_anchor":true},{"citing_arxiv_id":"2606.02843","citing_title":"The extensible no-$(k(n)+1)$-in-line problem","ref_index":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LFXMDLKZTX72PR2W2ANM44GE4E","json":"https://pith.science/pith/LFXMDLKZTX72PR2W2ANM44GE4E.json","graph_json":"https://pith.science/api/pith-number/LFXMDLKZTX72PR2W2ANM44GE4E/graph.json","events_json":"https://pith.science/api/pith-number/LFXMDLKZTX72PR2W2ANM44GE4E/events.json","paper":"https://pith.science/paper/LFXMDLKZ"},"agent_actions":{"view_html":"https://pith.science/pith/LFXMDLKZTX72PR2W2ANM44GE4E","download_json":"https://pith.science/pith/LFXMDLKZTX72PR2W2ANM44GE4E.json","view_paper":"https://pith.science/paper/LFXMDLKZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.00176&json=true","fetch_graph":"https://pith.science/api/pith-number/LFXMDLKZTX72PR2W2ANM44GE4E/graph.json","fetch_events":"https://pith.science/api/pith-number/LFXMDLKZTX72PR2W2ANM44GE4E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LFXMDLKZTX72PR2W2ANM44GE4E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LFXMDLKZTX72PR2W2ANM44GE4E/action/storage_attestation","attest_author":"https://pith.science/pith/LFXMDLKZTX72PR2W2ANM44GE4E/action/author_attestation","sign_citation":"https://pith.science/pith/LFXMDLKZTX72PR2W2ANM44GE4E/action/citation_signature","submit_replication":"https://pith.science/pith/LFXMDLKZTX72PR2W2ANM44GE4E/action/replication_record"}},"created_at":"2026-07-05T10:08:30.264679+00:00","updated_at":"2026-07-05T10:08:30.264679+00:00"}