{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:5HEQS23LLVGWLB6RFSPCYGUE5W","short_pith_number":"pith:5HEQS23L","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"},"canonical_sha256":"e9c9096b6b5d4d6587d12c9e2c1a84eda3f4b70a8d67e051865c6dfaa6f1cfa0","source":{"kind":"arxiv","id":"2508.07632","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.07632","created_at":"2026-07-05T11:51:49Z"},{"alias_kind":"arxiv_version","alias_value":"2508.07632v1","created_at":"2026-07-05T11:51:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.07632","created_at":"2026-07-05T11:51:49Z"},{"alias_kind":"pith_short_12","alias_value":"5HEQS23LLVGW","created_at":"2026-07-05T11:51:49Z"},{"alias_kind":"pith_short_16","alias_value":"5HEQS23LLVGWLB6R","created_at":"2026-07-05T11:51:49Z"},{"alias_kind":"pith_short_8","alias_value":"5HEQS23L","created_at":"2026-07-05T11:51:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:5HEQS23LLVGWLB6RFSPCYGUE5W","target":"record","payload":{"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"},"canonical_sha256":"e9c9096b6b5d4d6587d12c9e2c1a84eda3f4b70a8d67e051865c6dfaa6f1cfa0","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"},"source_kind":"arxiv","source_id":"2508.07632","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-05T11:51:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c4wf05Cly2mDAKjF4GuYoTM7qcsgKjowfRjfbqDSTcvgYqw3nF5WuapAfkFVO6RLmQsaJ+rI9HZBYaGQAK7ACg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T11:48:09.826388Z"},"content_sha256":"39b0701c0e43e6262a1e2663378f9bcae955011117a8b6c84092941ce2701777","schema_version":"1.0","event_id":"sha256:39b0701c0e43e6262a1e2663378f9bcae955011117a8b6c84092941ce2701777"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:5HEQS23LLVGWLB6RFSPCYGUE5W","target":"graph","payload":{"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"},"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-05T11:51:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l9lHmikRZ6PW1FVV0q8XWj8wqul5iJ/D0paKBPQti4SBGVS6DZIyQpzLJHE6mlJ776tiLfPvAkBFRvMok2Y0Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T11:48:09.826886Z"},"content_sha256":"2265db4f55902da0b9fe582cf4ef3dbf773737b0a64d79f09d06558f18f04833","schema_version":"1.0","event_id":"sha256:2265db4f55902da0b9fe582cf4ef3dbf773737b0a64d79f09d06558f18f04833"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5HEQS23LLVGWLB6RFSPCYGUE5W/bundle.json","state_url":"https://pith.science/pith/5HEQS23LLVGWLB6RFSPCYGUE5W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5HEQS23LLVGWLB6RFSPCYGUE5W/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-08T11:48:09Z","links":{"resolver":"https://pith.science/pith/5HEQS23LLVGWLB6RFSPCYGUE5W","bundle":"https://pith.science/pith/5HEQS23LLVGWLB6RFSPCYGUE5W/bundle.json","state":"https://pith.science/pith/5HEQS23LLVGWLB6RFSPCYGUE5W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5HEQS23LLVGWLB6RFSPCYGUE5W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:5HEQS23LLVGWLB6RFSPCYGUE5W","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":"d1ddd774b2715edd3a1f7c543067619bb998aca07fb9d2fbd206fe8317067693","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-08-11T05:25:37Z","title_canon_sha256":"eb1c172ef3dc68041a7782f660f9ff85264f608674d16b5efd7c2350d88f4337"},"schema_version":"1.0","source":{"id":"2508.07632","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.07632","created_at":"2026-07-05T11:51:49Z"},{"alias_kind":"arxiv_version","alias_value":"2508.07632v1","created_at":"2026-07-05T11:51:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.07632","created_at":"2026-07-05T11:51:49Z"},{"alias_kind":"pith_short_12","alias_value":"5HEQS23LLVGW","created_at":"2026-07-05T11:51:49Z"},{"alias_kind":"pith_short_16","alias_value":"5HEQS23LLVGWLB6R","created_at":"2026-07-05T11:51:49Z"},{"alias_kind":"pith_short_8","alias_value":"5HEQS23L","created_at":"2026-07-05T11:51:49Z"}],"graph_snapshots":[{"event_id":"sha256:2265db4f55902da0b9fe582cf4ef3dbf773737b0a64d79f09d06558f18f04833","target":"graph","created_at":"2026-07-05T11:51:49Z","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/2508.07632/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","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-08-11T05:25:37Z","title":"Randomised algebraic constructions for the no-$(k+1)$-in-line problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.07632","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:39b0701c0e43e6262a1e2663378f9bcae955011117a8b6c84092941ce2701777","target":"record","created_at":"2026-07-05T11:51:49Z","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":"d1ddd774b2715edd3a1f7c543067619bb998aca07fb9d2fbd206fe8317067693","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-08-11T05:25:37Z","title_canon_sha256":"eb1c172ef3dc68041a7782f660f9ff85264f608674d16b5efd7c2350d88f4337"},"schema_version":"1.0","source":{"id":"2508.07632","kind":"arxiv","version":1}},"canonical_sha256":"e9c9096b6b5d4d6587d12c9e2c1a84eda3f4b70a8d67e051865c6dfaa6f1cfa0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e9c9096b6b5d4d6587d12c9e2c1a84eda3f4b70a8d67e051865c6dfaa6f1cfa0","first_computed_at":"2026-07-05T11:51:49.490990Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:51:49.490990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CJNS0BsCmn7gHNqlX/KBi7rHEBS5Tc4tEsV7Grz7BAk3n0CMegAKKaG7rQ2DWyBjl/Q0duqb7ULrYFLLQxCaDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:51:49.491531Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.07632","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:39b0701c0e43e6262a1e2663378f9bcae955011117a8b6c84092941ce2701777","sha256:2265db4f55902da0b9fe582cf4ef3dbf773737b0a64d79f09d06558f18f04833"],"state_sha256":"bcd91047b3aa8cf022a4cce3fa6cb8eaf09070bd60c5380de1a79a266ab046e0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ST//3BlC8jlJT/ctMOELbDLpjksViNVtDveg1/4dESoX6UQ013Obo0Te1Fp3EqZeCI4CEgrvfxoe8AD+t1eTBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T11:48:09.831840Z","bundle_sha256":"0396d6e0d150b6d5103e065e4ed6a9c4b13bf0c2c37bacfe22bb8fe9d0752542"}}