{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:4MUSKOYXQCS2NYWZWOICOSB675","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":"bde8f15f8cd1fbb3c80c9e863dc880ecf5ee6e39e15f5cc39ecb0e1e43c8c01e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-01T20:07:01Z","title_canon_sha256":"2462ab6bedf8c3476c4b62773d87688ce60bf7b143eac0542ad50f11c5bbfeac"},"schema_version":"1.0","source":{"id":"2606.02843","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.02843","created_at":"2026-06-03T01:05:24Z"},{"alias_kind":"arxiv_version","alias_value":"2606.02843v1","created_at":"2026-06-03T01:05:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.02843","created_at":"2026-06-03T01:05:24Z"},{"alias_kind":"pith_short_12","alias_value":"4MUSKOYXQCS2","created_at":"2026-06-03T01:05:24Z"},{"alias_kind":"pith_short_16","alias_value":"4MUSKOYXQCS2NYWZ","created_at":"2026-06-03T01:05:24Z"},{"alias_kind":"pith_short_8","alias_value":"4MUSKOYX","created_at":"2026-06-03T01:05:24Z"}],"graph_snapshots":[{"event_id":"sha256:c213ce8e36c57883c0d8f15a649f255e32be2192700d8d9bc0cd2cfa9fff5c67","target":"graph","created_at":"2026-06-03T01:05:24Z","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/2606.02843/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The classical no-$k$-in-line problem asks for the largest number of points that can be placed on an $n \\times n$ grid without having $k$ of them collinear. A natural extension, motivated by the analogous question by Erde for $k\\in \\mathbb{Z}$, is the \\emph{extensible no-$(k(n)+1)$-in-line problem}, which seeks a subset of points in $\\mathbb{Z}^2$ with maximal possible density such that at most $k(n)$ points are collinear within the subgrid $[1,n]^2$.\n  We construct optimal sets for linear functions and positive-density sets for power functions. We prove that any configuration achieving $\\limin","authors_text":"Benedek N\\'ador, D\\'avid Melj\\'an, M\\'at\\'e J\\'anosik, Tam\\'as G\\'abriel","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-01T20:07:01Z","title":"The extensible no-$(k(n)+1)$-in-line problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.02843","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:38173f9135bda5a42210a544da3a5a8ee137730374d4fca8d48e006395a93580","target":"record","created_at":"2026-06-03T01:05:24Z","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":"bde8f15f8cd1fbb3c80c9e863dc880ecf5ee6e39e15f5cc39ecb0e1e43c8c01e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-01T20:07:01Z","title_canon_sha256":"2462ab6bedf8c3476c4b62773d87688ce60bf7b143eac0542ad50f11c5bbfeac"},"schema_version":"1.0","source":{"id":"2606.02843","kind":"arxiv","version":1}},"canonical_sha256":"e329253b1780a5a6e2d9b39027483eff694de078fad3a0c8d26ba7b7a81b10ae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e329253b1780a5a6e2d9b39027483eff694de078fad3a0c8d26ba7b7a81b10ae","first_computed_at":"2026-06-03T01:05:24.408589Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-03T01:05:24.408589Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"77iBZW/mw/VAdk1JVxi+ywKZ+O4h0QSiMl8p/Y7fs5Y+psPK7w8yv4rskZrez/ZJi7CJcpN6bhIusrMgfweuBA==","signature_status":"signed_v1","signed_at":"2026-06-03T01:05:24.408956Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.02843","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:38173f9135bda5a42210a544da3a5a8ee137730374d4fca8d48e006395a93580","sha256:c213ce8e36c57883c0d8f15a649f255e32be2192700d8d9bc0cd2cfa9fff5c67"],"state_sha256":"e0e8574c68f74e7f1ccd0eb968797e1723412327f667dd7532bbf94f21f40047"}