{"id":"fd99eb02-80a0-40f2-af96-a830fb2dba7b","arxiv_id":"2610.22021","paper_version":1,"verdict":"ACCEPT","confidence":"MODERATE","novelty_score":8.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"The paper proves T(r) >= r^2 + r + 2 for every r, resolving the asymptotic Erdős-Frankl-Füredi conjecture T(r) = (1+o(1)) r^2.","lead":"A 1985 conjecture in extremal set theory has been confirmed: the threshold at which an r-cover-free family can have more members than points is asymptotically r squared. The proof matches the known affine-plane upper bound with a new double-counting argument based on private and pseudo-private pairs.","discovery_kind":"first_principles","skeptic_critique":null,"referee_report":{"model":"deepseek/deepseek-v4-flash","summary":"The paper proves Theorem 1.2: for every r≥1, T(r)≥r^2+r+2, which matches the affine-plane upper bound T(r)≤(1+o(1))r^2 and thereby confirms the 1985 Erdős–Frankl–Füredi conjecture that T(r)=(1+o(1))r^2. The proof is by induction on r and contradiction: assuming n≤r^2+r+1 and an r-cover-free family F of size n+1 on [n], Fact 2.3 shows that every ground element lies in at least two members and that every member has size between r+1 and 2r−1. For each A∈F, the family H_A is the down-closure of the intersections A∩B for B≠A, and q_A counts the private pairs of A. Members are classified as good or bad according to whether q_A reaches C(r+1,2). Lemma 2.5 reduces the contradiction to constructing pseudo-private collections for the bad members; its proof uses a C4-free bipartite incidence graph and a double-counting argument. Lemma 2.6 supplies the required collections via the cited Stehlík theorem, a decomposition into connected components, and local collections P_i in restricted families H_i[U_i], followed by a quadratic minimization in the parameters s and M. The concluding remarks record that the stronger Conjecture 3.1, T(r)≥(r+1)^2, remains open.","tokens_in":12038,"tokens_out":53457,"duration_ms":707036,"significance":"If correct, the paper resolves a 1985 conjecture of Erdős, Frankl and Füredi and improves the best general lower bound from roughly 0.86r^2 to the asymptotic truth. The proof is self-contained apart from the quoted Stehlík theorem, the constants are uniform for all r, and no fitted parameters or post hoc exclusions appear. The result also has immediate consequences for the frameproof-code thresholds studied in [11] and [24], as the paper explains. The finite version T(r)≥(r+1)^2 is not proved, so the paper does not claim sharpness of the affine-plane construction beyond the asymptotic regime. I checked the Stehlík application, the component decomposition, the C4-free double counting, and the final algebra; the line of argument is coherent and the cited theorem is used within its stated hypotheses.","major_comments":[],"minor_comments":[{"comment":"As printed, J_i is defined as the set of vertex-pairs α with f_i(α)∈E(G'_i−z_i), without requiring α itself to be an edge of G'_i. Under this literal reading, P_i={α∈J_i: α∩L_i=∅} can contain pairs that are not edges of G(H_i); such pairs need not be non-private pairs of A, so P_i need not be a pseudo-private collection in the sense of Definition 2.4, and the later assertion that every pair in ∪_{A∈B} P_A is non-private would not follow. The intended definition is evidently J_i={α∈E(G'_i−z_i): f_i(α)∈E(G'_i−z_i)}; equation (2) and the estimates (3)–(5) are consistent with that reading. I therefore treat this as a local notational correction, but the authors should fix the definition and re-verify the surrounding paragraph.","section":"§2, Claim 2.8, definition of J_i","authors_acknowledge":null,"authors_acknowledge_p":null},{"comment":"The displayed lower bound in Lemma 2.6 is rendered ambiguously as r(r+1)+16 over 6, while the proof concludes with (r(r+1)+1)/6 and Lemma 2.5's derivation uses the same constant. The authors should ensure that every instance of this constant is the intended (r(r+1)+1)/6.","section":"§2, Lemma 2.6 display","authors_acknowledge":null,"authors_acknowledge_p":null},{"comment":"The proof of Fact 2.3(2) states that the members of F_A are nonempty; this deserves one sentence of justification, namely that B\\A=∅ would give B⊆A and hence a cover of B by the single other member A, contradicting r-cover-freeness for r≥2.","section":"§2, Fact 2.3 proof","authors_acknowledge":null,"authors_acknowledge_p":null},{"comment":"In the sentence quoting Shangguan and Ge's bound, the expression '0.86n^2' should be '0.86r^2'.","section":"§1, paragraph on earlier bounds","authors_acknowledge":null,"authors_acknowledge_p":null},{"comment":"The AI usage note refers to 'Theorem 2.6'; the theorem being discussed appears to be Lemma 2.6. This should be corrected for consistency.","section":"AI usage statement","authors_acknowledge":null,"authors_acknowledge_p":null}],"recommendation":"minor_revision"},"author_rebuttal":null,"desk_editor":{"model":"deepseek/deepseek-v4-flash","letter":"Short version: this looks like the real thing. The paper proves T(r) ≥ r² + r + 2 for every r, which, together with the affine-plane construction giving T(r) ≤ (1+o(1))r², settles the 1985 Erdős–Frankl–Füredi conjecture. The previous general lower bound was about 0.86r², so this is a substantial jump, not an incremental cleanup.\n\nWhat is actually new is the method. The pseudo-private pair notion, the C₄-free auxiliary bipartite graph, and the component-level construction in Lemma 2.6 are not repackaged known tools. The paper also correctly notes that the frameproof-code thresholds follow directly from Theorem 1.2 via existing relations; that is a genuine corollary, not an overclaim.\n\nI worked through the main steps the way the reader did: Fact 2.3, the double counting in Lemma 2.5, the decomposition in Lemma 2.6, inequality (6), and the final quadratic minimization. I agree there are no fitted parameters and no circularity. The only external load-bearing result is Stehlík's theorem, which is published and appears to be used in exactly the setting for which it is stated. The induction step in Fact 2.3(2) also checks out.\n\nSoft spots: the proof is long and the local claims in Lemma 2.6 are delicate. The compensating-pair construction depends on the partition supplied by Stehlík's theorem, so that import is the natural place for a referee to focus. I did not machine-check the inequalities, and for a proof this intricate that would be the only way to get from moderate to high confidence. A minor point: the authors state in their concluding remarks that the stronger conjecture T(r) ≥ (r+1)² remains open, which is honest and should stay in the paper.\n\nWho is this for? Extremal combinatorists and coding theorists working on cover-free families, superimposed codes, and frameproof codes. A coding theorist can use the threshold result directly; a combinatorialist will be interested in the pseudo-private pair method as a reusable technique.\n\nMy recommendation: send it to peer review. It deserves a serious referee, with the specific assignment of checking Lemma 2.6 and the application of Stehlík's theorem. I expect it to survive, but this is a proof that needs line-by-line verification, not a quick skim.","headline":"A genuine proof of the Erdős–Frankl–Füredi threshold conjecture, with a new pseudo-private pair technique; the proof is intricate and worth a careful referee, but I found no load-bearing flaw.","tokens_in":12551,"tokens_out":1399,"duration_ms":13843},"pith_extraction":null,"created_at":"2026-10-16T08:28:22.587555+00:00","model_set":{"reader":"deepseek/deepseek-v4-flash"},"pipeline_version":"pith-pipeline@v1.4.1-daily-deepseek-or-medium","input_kind":null,"input_chars":null,"input_total_chars":null,"passes_missing":null,"published_standing":null,"published_confidence":null,"objection_audit":null,"run_record":null,"basis":{"kind":"not_recorded","source":null,"chars_given":null,"chars_total":null},"receipt":null,"falsifier":null,"supporting_citations":[],"lane_accuracy":{"status":"not yet measured","lane":{"model":"deepseek/deepseek-v4-flash","input_kind":null},"url":"https://pith.science/accuracy"},"review_version":1}