{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:RKEBR6FFYGA274W4UJNIZD3MNC","short_pith_number":"pith:RKEBR6FF","canonical_record":{"source":{"id":"2607.05255","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-06T16:01:49Z","cross_cats_sorted":["math.MG"],"title_canon_sha256":"cb7303566097868fb0bdacd96a8810c71f6affa876d0d4b27d3c7184b44141f0","abstract_canon_sha256":"f3bc107472456f672e3beaaa558ac7d31f7d1d7a55e0d8f389b1e873a423c28d"},"schema_version":"1.0"},"canonical_sha256":"8a8818f8a5c181aff2dca25a8c8f6c68a7f4376bf94d2712ced8795298cd88ba","source":{"kind":"arxiv","id":"2607.05255","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.05255","created_at":"2026-07-07T03:19:21Z"},{"alias_kind":"arxiv_version","alias_value":"2607.05255v1","created_at":"2026-07-07T03:19:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.05255","created_at":"2026-07-07T03:19:21Z"},{"alias_kind":"pith_short_12","alias_value":"RKEBR6FFYGA2","created_at":"2026-07-07T03:19:21Z"},{"alias_kind":"pith_short_16","alias_value":"RKEBR6FFYGA274W4","created_at":"2026-07-07T03:19:21Z"},{"alias_kind":"pith_short_8","alias_value":"RKEBR6FF","created_at":"2026-07-07T03:19:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:RKEBR6FFYGA274W4UJNIZD3MNC","target":"record","payload":{"canonical_record":{"source":{"id":"2607.05255","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-06T16:01:49Z","cross_cats_sorted":["math.MG"],"title_canon_sha256":"cb7303566097868fb0bdacd96a8810c71f6affa876d0d4b27d3c7184b44141f0","abstract_canon_sha256":"f3bc107472456f672e3beaaa558ac7d31f7d1d7a55e0d8f389b1e873a423c28d"},"schema_version":"1.0"},"canonical_sha256":"8a8818f8a5c181aff2dca25a8c8f6c68a7f4376bf94d2712ced8795298cd88ba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-07T03:19:21.209911Z","signature_b64":"jIOGHyhdyFjRDicHunUcN1jiB68bLNCsOmRWbveo01Y+wkwNjcA8cYwKn4xL72ARl7df8IYV4t0cbYimSHnaDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a8818f8a5c181aff2dca25a8c8f6c68a7f4376bf94d2712ced8795298cd88ba","last_reissued_at":"2026-07-07T03:19:21.209478Z","signature_status":"signed_v1","first_computed_at":"2026-07-07T03:19:21.209478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.05255","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-07T03:19:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xH7r/kWusQIQbcABbaeNXernSklwq+dWmNK54jF47HpWIosXCqzUtkrnna+YpQwgUUfcFDqIn7CAuoV1RXeCAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T15:22:05.658470Z"},"content_sha256":"8f35781e1829cd685e067c5e340ff4776a4a1cda5db32ee857deaa03a65e6a4f","schema_version":"1.0","event_id":"sha256:8f35781e1829cd685e067c5e340ff4776a4a1cda5db32ee857deaa03a65e6a4f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:RKEBR6FFYGA274W4UJNIZD3MNC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"No-$(k+1)$-in-line problem for $k \\geqslant 3$","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"math.CO","authors_text":"Alexandr Grebennikov, Anubhab Ghosal, Huy Tuan Pham, Matthew Kwan, Peter Keevash, Ritesh Goenka","submitted_at":"2026-07-06T16:01:49Z","abstract_excerpt":"What is the maximum number of points one can place in an $n \\times n$ grid such that every Euclidean line contains at most $k$ points? For $k = 2$, this is the notorious no-three-in-line problem of Dudeney. In this paper, we resolve this problem for all other $k$ (and sufficiently large $n$). Namely, for $k \\geqslant 3$ and sufficiently large $n$, we show that this maximum is exactly $kn$.\n  To prove this, our key observation is that in the regime $k \\geqslant 3$, the problem is dominated in a certain statistical sense by the influence of a small number of \"heavy\" lines with many grid points. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.05255","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/2607.05255/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-07T03:19:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NIxdMpUKLq3AKuyvwb82mVr5ctcjRSUKEI6sjwKJHVTdJMsWVi37Pm/v0j/ySEpMrBT1bB1UvI/cTR/MY8CpDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T15:22:05.659111Z"},"content_sha256":"709354326fa019af9dc47b1ea460df7a602e06f7a6e5c328d8fabdd09853cd68","schema_version":"1.0","event_id":"sha256:709354326fa019af9dc47b1ea460df7a602e06f7a6e5c328d8fabdd09853cd68"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RKEBR6FFYGA274W4UJNIZD3MNC/bundle.json","state_url":"https://pith.science/pith/RKEBR6FFYGA274W4UJNIZD3MNC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RKEBR6FFYGA274W4UJNIZD3MNC/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-13T15:22:05Z","links":{"resolver":"https://pith.science/pith/RKEBR6FFYGA274W4UJNIZD3MNC","bundle":"https://pith.science/pith/RKEBR6FFYGA274W4UJNIZD3MNC/bundle.json","state":"https://pith.science/pith/RKEBR6FFYGA274W4UJNIZD3MNC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RKEBR6FFYGA274W4UJNIZD3MNC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:RKEBR6FFYGA274W4UJNIZD3MNC","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":"f3bc107472456f672e3beaaa558ac7d31f7d1d7a55e0d8f389b1e873a423c28d","cross_cats_sorted":["math.MG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-06T16:01:49Z","title_canon_sha256":"cb7303566097868fb0bdacd96a8810c71f6affa876d0d4b27d3c7184b44141f0"},"schema_version":"1.0","source":{"id":"2607.05255","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.05255","created_at":"2026-07-07T03:19:21Z"},{"alias_kind":"arxiv_version","alias_value":"2607.05255v1","created_at":"2026-07-07T03:19:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.05255","created_at":"2026-07-07T03:19:21Z"},{"alias_kind":"pith_short_12","alias_value":"RKEBR6FFYGA2","created_at":"2026-07-07T03:19:21Z"},{"alias_kind":"pith_short_16","alias_value":"RKEBR6FFYGA274W4","created_at":"2026-07-07T03:19:21Z"},{"alias_kind":"pith_short_8","alias_value":"RKEBR6FF","created_at":"2026-07-07T03:19:21Z"}],"graph_snapshots":[{"event_id":"sha256:709354326fa019af9dc47b1ea460df7a602e06f7a6e5c328d8fabdd09853cd68","target":"graph","created_at":"2026-07-07T03:19:21Z","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/2607.05255/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 one can place in an $n \\times n$ grid such that every Euclidean line contains at most $k$ points? For $k = 2$, this is the notorious no-three-in-line problem of Dudeney. In this paper, we resolve this problem for all other $k$ (and sufficiently large $n$). Namely, for $k \\geqslant 3$ and sufficiently large $n$, we show that this maximum is exactly $kn$.\n  To prove this, our key observation is that in the regime $k \\geqslant 3$, the problem is dominated in a certain statistical sense by the influence of a small number of \"heavy\" lines with many grid points. ","authors_text":"Alexandr Grebennikov, Anubhab Ghosal, Huy Tuan Pham, Matthew Kwan, Peter Keevash, Ritesh Goenka","cross_cats":["math.MG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-06T16:01:49Z","title":"No-$(k+1)$-in-line problem for $k \\geqslant 3$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.05255","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:8f35781e1829cd685e067c5e340ff4776a4a1cda5db32ee857deaa03a65e6a4f","target":"record","created_at":"2026-07-07T03:19:21Z","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":"f3bc107472456f672e3beaaa558ac7d31f7d1d7a55e0d8f389b1e873a423c28d","cross_cats_sorted":["math.MG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-06T16:01:49Z","title_canon_sha256":"cb7303566097868fb0bdacd96a8810c71f6affa876d0d4b27d3c7184b44141f0"},"schema_version":"1.0","source":{"id":"2607.05255","kind":"arxiv","version":1}},"canonical_sha256":"8a8818f8a5c181aff2dca25a8c8f6c68a7f4376bf94d2712ced8795298cd88ba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8a8818f8a5c181aff2dca25a8c8f6c68a7f4376bf94d2712ced8795298cd88ba","first_computed_at":"2026-07-07T03:19:21.209478Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-07T03:19:21.209478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jIOGHyhdyFjRDicHunUcN1jiB68bLNCsOmRWbveo01Y+wkwNjcA8cYwKn4xL72ARl7df8IYV4t0cbYimSHnaDw==","signature_status":"signed_v1","signed_at":"2026-07-07T03:19:21.209911Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.05255","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8f35781e1829cd685e067c5e340ff4776a4a1cda5db32ee857deaa03a65e6a4f","sha256:709354326fa019af9dc47b1ea460df7a602e06f7a6e5c328d8fabdd09853cd68"],"state_sha256":"3ce697356d253d0e6c25200a7c7132a608774b5a6a08e819647c14dead30b327"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xNAZ1IPvDyHMY/FEYbrptJyfT+DtvUIhj3WIQDfKBbGs9xa2lWYYO1OdqcVyOgO1y50QnMbPoe/qInJABf8LAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T15:22:05.664111Z","bundle_sha256":"15c12072bb241905bb88d338ee4bf1e7e521e3e4924988be1302c18469abbc9a"}}