{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:LFXMDLKZTX72PR2W2ANM44GE4E","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":"9c39b4d4c63c8711792e63a0497683d5a6fb1a8e6212d26647e794c83aa676b0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-01-31T21:40:16Z","title_canon_sha256":"057ba86284fc5e88b5275edd4e2adc927d4ffd9c9a7ceab17278084e317e0908"},"schema_version":"1.0","source":{"id":"2502.00176","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.00176","created_at":"2026-07-05T10:08:30Z"},{"alias_kind":"arxiv_version","alias_value":"2502.00176v1","created_at":"2026-07-05T10:08:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.00176","created_at":"2026-07-05T10:08:30Z"},{"alias_kind":"pith_short_12","alias_value":"LFXMDLKZTX72","created_at":"2026-07-05T10:08:30Z"},{"alias_kind":"pith_short_16","alias_value":"LFXMDLKZTX72PR2W","created_at":"2026-07-05T10:08:30Z"},{"alias_kind":"pith_short_8","alias_value":"LFXMDLKZ","created_at":"2026-07-05T10:08:30Z"}],"graph_snapshots":[{"event_id":"sha256:d32c78fe20229f8a7b4c7c7db29ba93e3cd51f47d824e6f15268bc0f9360ee0d","target":"graph","created_at":"2026-07-05T10:08:30Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2502.00176/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Benedek Kov\\'acs, D\\'avid R. Szab\\'o, Zolt\\'an L\\'or\\'ant Nagy","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-01-31T21:40:16Z","title":"Settling the no-$(k+1)$-in-line problem when $k$ is not small"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.00176","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:b64f8ad0195138b089aecde89f91a88686e9e30fd113e3c87e09d69ac23689a5","target":"record","created_at":"2026-07-05T10:08:30Z","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":"9c39b4d4c63c8711792e63a0497683d5a6fb1a8e6212d26647e794c83aa676b0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-01-31T21:40:16Z","title_canon_sha256":"057ba86284fc5e88b5275edd4e2adc927d4ffd9c9a7ceab17278084e317e0908"},"schema_version":"1.0","source":{"id":"2502.00176","kind":"arxiv","version":1}},"canonical_sha256":"596ec1ad599dffa7c756d01ace70c4e12718faf8182c2c65555324eeca6364ae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"596ec1ad599dffa7c756d01ace70c4e12718faf8182c2c65555324eeca6364ae","first_computed_at":"2026-07-05T10:08:30.264620Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:08:30.264620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"l0UjAorYbuKHCjBRHk4u9ErWJW0kYHvmQfcipA8ESThNyHxYgJ5trGbX3nKOIYQCmHom1KmQI5TeptZGs8VmBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:08:30.265013Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.00176","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b64f8ad0195138b089aecde89f91a88686e9e30fd113e3c87e09d69ac23689a5","sha256:d32c78fe20229f8a7b4c7c7db29ba93e3cd51f47d824e6f15268bc0f9360ee0d"],"state_sha256":"2354948dca002785a7a82abd83993bebb139a8d20fbfa9ea9cfc2bba25ab5889"}