{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:5HEQS23LLVGWLB6RFSPCYGUE5W","short_pith_number":"pith:5HEQS23L","schema_version":"1.0","canonical_sha256":"e9c9096b6b5d4d6587d12c9e2c1a84eda3f4b70a8d67e051865c6dfaa6f1cfa0","source":{"kind":"arxiv","id":"2508.07632","version":1},"attestation_state":"computed","paper":{"title":"Randomised algebraic constructions for the no-$(k+1)$-in-line problem","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-08-11T05:25:37Z","abstract_excerpt":"The no-(k+1)-in line problem seeks the maximum number of points that can be selected from an $n \\times n$ square lattice such that no $k+1$ of them are collinear. The problem was first posed more than $100$ years ago for the special case $k=2$ and has remained open ever since. The general problem was recently resolved in the case $k$ is not small compared to $n$, as Kov\\'acs, Nagy and Szab\\'o proved that the upper bound $kn$ can be attained, provided that $k>C\\sqrt{n\\log{n}}$ for an absolute constant $C$.\n  In this paper, we show that $\\left(1-\\tfrac{2}{k}\\right)kn \\leq f_k(n)\\leq kn$ and $\\le"},"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":"2508.07632","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-08-11T05:25:37Z","cross_cats_sorted":[],"title_canon_sha256":"eb1c172ef3dc68041a7782f660f9ff85264f608674d16b5efd7c2350d88f4337","abstract_canon_sha256":"d1ddd774b2715edd3a1f7c543067619bb998aca07fb9d2fbd206fe8317067693"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:51:49.491531Z","signature_b64":"CJNS0BsCmn7gHNqlX/KBi7rHEBS5Tc4tEsV7Grz7BAk3n0CMegAKKaG7rQ2DWyBjl/Q0duqb7ULrYFLLQxCaDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9c9096b6b5d4d6587d12c9e2c1a84eda3f4b70a8d67e051865c6dfaa6f1cfa0","last_reissued_at":"2026-07-05T11:51:49.490990Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:51:49.490990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Randomised algebraic constructions for the no-$(k+1)$-in-line problem","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-08-11T05:25:37Z","abstract_excerpt":"The no-(k+1)-in line problem seeks the maximum number of points that can be selected from an $n \\times n$ square lattice such that no $k+1$ of them are collinear. The problem was first posed more than $100$ years ago for the special case $k=2$ and has remained open ever since. The general problem was recently resolved in the case $k$ is not small compared to $n$, as Kov\\'acs, Nagy and Szab\\'o proved that the upper bound $kn$ can be attained, provided that $k>C\\sqrt{n\\log{n}}$ for an absolute constant $C$.\n  In this paper, we show that $\\left(1-\\tfrac{2}{k}\\right)kn \\leq f_k(n)\\leq kn$ and $\\le"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.07632","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/2508.07632/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":"2508.07632","created_at":"2026-07-05T11:51:49.491048+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.07632v1","created_at":"2026-07-05T11:51:49.491048+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.07632","created_at":"2026-07-05T11:51:49.491048+00:00"},{"alias_kind":"pith_short_12","alias_value":"5HEQS23LLVGW","created_at":"2026-07-05T11:51:49.491048+00:00"},{"alias_kind":"pith_short_16","alias_value":"5HEQS23LLVGWLB6R","created_at":"2026-07-05T11:51:49.491048+00:00"},{"alias_kind":"pith_short_8","alias_value":"5HEQS23L","created_at":"2026-07-05T11:51:49.491048+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.05255","citing_title":"No-$(k+1)$-in-line problem for $k \\geqslant 3$","ref_index":26,"is_internal_anchor":true},{"citing_arxiv_id":"2606.26399","citing_title":"Geometry-Aware MCTS for Extremal Problems in Combinatorial Geometry","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2605.09215","citing_title":"No-three-in-line sets on the checkerboard grid","ref_index":25,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5HEQS23LLVGWLB6RFSPCYGUE5W","json":"https://pith.science/pith/5HEQS23LLVGWLB6RFSPCYGUE5W.json","graph_json":"https://pith.science/api/pith-number/5HEQS23LLVGWLB6RFSPCYGUE5W/graph.json","events_json":"https://pith.science/api/pith-number/5HEQS23LLVGWLB6RFSPCYGUE5W/events.json","paper":"https://pith.science/paper/5HEQS23L"},"agent_actions":{"view_html":"https://pith.science/pith/5HEQS23LLVGWLB6RFSPCYGUE5W","download_json":"https://pith.science/pith/5HEQS23LLVGWLB6RFSPCYGUE5W.json","view_paper":"https://pith.science/paper/5HEQS23L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.07632&json=true","fetch_graph":"https://pith.science/api/pith-number/5HEQS23LLVGWLB6RFSPCYGUE5W/graph.json","fetch_events":"https://pith.science/api/pith-number/5HEQS23LLVGWLB6RFSPCYGUE5W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5HEQS23LLVGWLB6RFSPCYGUE5W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5HEQS23LLVGWLB6RFSPCYGUE5W/action/storage_attestation","attest_author":"https://pith.science/pith/5HEQS23LLVGWLB6RFSPCYGUE5W/action/author_attestation","sign_citation":"https://pith.science/pith/5HEQS23LLVGWLB6RFSPCYGUE5W/action/citation_signature","submit_replication":"https://pith.science/pith/5HEQS23LLVGWLB6RFSPCYGUE5W/action/replication_record"}},"created_at":"2026-07-05T11:51:49.491048+00:00","updated_at":"2026-07-05T11:51:49.491048+00:00"}