{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:LFXMDLKZTX72PR2W2ANM44GE4E","short_pith_number":"pith:LFXMDLKZ","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"},"canonical_sha256":"596ec1ad599dffa7c756d01ace70c4e12718faf8182c2c65555324eeca6364ae","source":{"kind":"arxiv","id":"2502.00176","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:LFXMDLKZTX72PR2W2ANM44GE4E","target":"record","payload":{"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"},"canonical_sha256":"596ec1ad599dffa7c756d01ace70c4e12718faf8182c2c65555324eeca6364ae","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"},"source_kind":"arxiv","source_id":"2502.00176","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:08:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A2qUUWoy8Iz562s/Rp0RPU+HGYs96QxmQjCZL6Km6znLMcpCd2tid7MpsqDsxoGJO2grrIBXZylByJzxmAirDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T18:07:21.190598Z"},"content_sha256":"b64f8ad0195138b089aecde89f91a88686e9e30fd113e3c87e09d69ac23689a5","schema_version":"1.0","event_id":"sha256:b64f8ad0195138b089aecde89f91a88686e9e30fd113e3c87e09d69ac23689a5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:LFXMDLKZTX72PR2W2ANM44GE4E","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:08:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pefW3bUlXzb0AtYakFlse3M3tnBvOApEi86qbk33dO1i7GuiD0c0hgRmIlrDSE+096T5Hi33NsacqOy7APScBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T18:07:21.191532Z"},"content_sha256":"d32c78fe20229f8a7b4c7c7db29ba93e3cd51f47d824e6f15268bc0f9360ee0d","schema_version":"1.0","event_id":"sha256:d32c78fe20229f8a7b4c7c7db29ba93e3cd51f47d824e6f15268bc0f9360ee0d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LFXMDLKZTX72PR2W2ANM44GE4E/bundle.json","state_url":"https://pith.science/pith/LFXMDLKZTX72PR2W2ANM44GE4E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LFXMDLKZTX72PR2W2ANM44GE4E/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-07T18:07:21Z","links":{"resolver":"https://pith.science/pith/LFXMDLKZTX72PR2W2ANM44GE4E","bundle":"https://pith.science/pith/LFXMDLKZTX72PR2W2ANM44GE4E/bundle.json","state":"https://pith.science/pith/LFXMDLKZTX72PR2W2ANM44GE4E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LFXMDLKZTX72PR2W2ANM44GE4E/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I1di4sChWQDJUcZD53TEosYLbTFWCaqgs4QvKEY5fI4+5VrJ3+Cb9toVIwQrPJeRmYKpakAugcE00bw68kpoAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T18:07:21.196534Z","bundle_sha256":"3cede590762dfc7ff214c2f47b0a1450d47d25f728963ff202d9b4d64f904dac"}}