{"paper":{"title":"Matching statistics in regular hypergraphs and applications","arxiv_id":"2611.17197","primary_cat":"math.CO","submitted_at":"2026-11-12T18:01:14+00:00","version_compiled":"v1"},"notice":"Every quoted sentence is the authors' text from the arXiv listing abstract. Labels and probabilities are the outputs of classifier-1.13.0 on the question bank abstract-p1-20260923, exactly as returned. No sentence in this record was written by a language model.","schema":"pith.compiled-record/v0","status":"compiled","abstract":{"source":"arXiv listing abstract v1","sentences":[{"i":0,"p":0.7,"id":"s0","own":true,"role":"contribution","text":"For fixed $k\\ge3$, we determine the first sublinear correction to the logarithm of the matching partition function for a class of $n$-vertex $d$-regular $k$-uniform hypergraphs, uniformly for activities in each fixed compact interval of $(0,\\infty)$.Our hypotheses include every regular linear hypergraph of polynomial degree and a class of nonlinear hypergraphs described by higher codegrees and intersection patterns, which we introduce here.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.96,"main_claim_p":0.74,"quantitative":true,"quantitative_p":0.51,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.3,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.7,"interpretation":0.0}},{"i":1,"p":0.53,"id":"s1","own":true,"role":"result","text":"The weighted counting estimate implies an averaged version of Kahn's conjecture: under the uniform measure, the expected number of uncovered vertices is $(1+o(1))nd^{-1/k}$, with concentration and large deviations on this scale.","hedge":{"p":0.98,"label":"asserted"},"own_p":0.85,"main_claim_p":0.31,"quantitative":true,"quantitative_p":0.98,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.53,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.47}},{"i":2,"p":0.99,"id":"s2","own":true,"role":"method","text":"The proof combines a novel variant of random greedy counting, based on short stages and regular completions, with a new entropy method that uses intersection patterns to control reconstruction after deleting matching edges.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.94,"main_claim_p":0.04,"quantitative":false,"quantitative_p":0.04,"role_probabilities":{"gap":0.0,"method":0.99,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.01,"interpretation":0.0}},{"i":3,"p":0.79,"id":"s3","own":false,"role":"contribution","text":"We highlight the following applications.","hedge":{"p":0.75,"label":"unclear"},"own_p":0.43,"main_claim_p":0.01,"quantitative":false,"quantitative_p":0.02,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.05,"background":0.01,"limitation":0.0,"future_work":0.04,"contribution":0.79,"interpretation":0.11}},{"i":4,"p":0.58,"id":"s4","own":false,"role":"contribution","text":"(i) Partial transversals in Latin squares.","hedge":{"p":0.86,"label":"unclear"},"own_p":0.49,"main_claim_p":0.02,"quantitative":false,"quantitative_p":0.03,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.36,"background":0.02,"limitation":0.0,"future_work":0.01,"contribution":0.58,"interpretation":0.03}},{"i":5,"p":0.99,"id":"s5","own":true,"role":"result","text":"Every Latin square of order $n$ has $(n/e^2)^n\\exp((3+o(1))n^{2/3})$ partial transversals.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.85,"main_claim_p":0.1,"quantitative":true,"quantitative_p":0.99,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.99,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.01,"interpretation":0.0}},{"i":6,"p":1.0,"id":"s6","own":true,"role":"result","text":"Also, almost all partial transversals have $(1+o(1))n^{2/3}$ missing cells.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.85,"main_claim_p":0.05,"quantitative":true,"quantitative_p":0.98,"role_probabilities":{"gap":0.0,"method":0.0,"result":1.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":7,"p":0.55,"id":"s7","own":true,"role":"contribution","text":"(ii) Linear $3$-uniform hypergraphs.","hedge":{"p":0.72,"label":"asserted"},"own_p":0.67,"main_claim_p":0.03,"quantitative":false,"quantitative_p":0.13,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.38,"background":0.06,"limitation":0.0,"future_work":0.0,"contribution":0.55,"interpretation":0.01}},{"i":8,"p":0.99,"id":"s8","own":true,"role":"result","text":"There are $(n/e^2)^{n^2/6}\\exp((1/2+o(1))n^{5/3})$ linear $3$-uniform hypergraphs on $[n]$, and almost all have $n^2/6-(1/6+o(1))n^{5/3}$ edges.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.88,"main_claim_p":0.05,"quantitative":true,"quantitative_p":0.99,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.99,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.01,"interpretation":0.0}},{"i":9,"p":0.69,"id":"s9","own":false,"role":"contribution","text":"(iii) Matroids of fixed rank.","hedge":{"p":0.87,"label":"unclear"},"own_p":0.43,"main_claim_p":0.02,"quantitative":false,"quantitative_p":0.04,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.27,"background":0.03,"limitation":0.0,"future_work":0.0,"contribution":0.69,"interpretation":0.01}},{"i":10,"p":0.97,"id":"s10","own":true,"role":"result","text":"For each fixed $r\\ge4$, the number $m(n,r)$ of rank-$r$ matroids on $[n]$ satisfies $\\log m(n,r)=\\frac{n^{r-1}}{r!}(\\log n-r+1)+\\left(\\frac1{(r-1)!}+o(1)\\right)n^{r-1-1/r}$, refining the estimates of van der Hofstad, Pendavingh and van der Pol.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.89,"main_claim_p":0.07,"quantitative":true,"quantitative_p":0.98,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.97,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.03,"interpretation":0.0}}]},"compiled":{"main_claim":{"p":0.98,"text":"For fixed $k\\ge3$, we determine the first sublinear correction to the logarithm of the matching partition function for a class of $n$-vertex $d$-regular $k$-uniform hypergraphs, uniformly for activities in each fixed compact interval of $(0,\\infty)$.Our hypotheses include every regular linear hypergraph of polynomial degree and a class of nonlinear hypergraphs described by higher codegrees and intersection patterns, which we introduce here.","location":"abstract s0","hedge_strength":{"p":1.0,"label":"asserted"}},"provenance":{"route":{"via":"TypeSafe API","model":"classifier-1.13.0","endpoint":"https://api.typesafe.ai/v1/systemone","provider":"TypeSafe"},"packing":"one request per paper","requests":1,"input_tokens":8574,"cost_usd_reported":0.0},"compiled_at":"2026-11-14","bank_version":"abstract-p1-20260923","model_version":"classifier-1.13.0","abstract_states":{"claims_first":0.17,"states_limitation":0.3,"human_participants":0.01,"controlled_comparison":0.02,"randomized_assignment":0.03,"states_quantitative_result":0.98,"compares_with_prior_results":0.77,"mentions_code_or_data_availability":0.01},"evidential_basis":{"p":1.0,"value":"proof or derivation","probabilities":{"argument":0.0,"literature":0.0,"proof_or_derivation":1.0,"analysis_of_existing_data":0.0,"observation_or_experiment":0.0,"simulation_or_computation":0.0}},"contribution_type":{"p":1.0,"value":"theoretical result","probabilities":{"review":0.0,"method_or_tool":0.0,"empirical_study":0.0,"simulation_study":0.0,"theoretical_result":1.0,"dataset_or_benchmark":0.0,"position_or_commentary":0.0}},"contribution_statement":{"p":0.52,"text":"The proof combines a novel variant of random greedy counting, based on short stages and regular completions, with a new entropy method that uses intersection patterns to control reconstruction after deleting matching edges.","location":"abstract s2"}},"coverage":{"tier":"abstract","levels_run":["P abstract"],"not_examined":["full text","figures and tables","references and citing sentences","relations to other papers"],"sources_read":["arXiv listing abstract v1"],"levels_not_run":["S sections","T body sentences","C citations","R cross-paper relations"],"sentences_examined":11,"sentences_in_abstract":11},"measured_accuracy":{"url":"https://pith.science/accuracy","measured_on":"2026-10-02","method":"two independent model families labelled a fresh random sample blind; the figure is how often the published label matches their consensus","sentence_role_agreement":0.92,"main_claim_agreement":0.908,"typed_citation_agreement":0.933,"typed_citation_agreement_95_interval":[0.917,0.945],"review_comments_accurate":0.758,"review_comments_accurate_95_interval":[0.684,0.82],"review_caught_admitted_error_found_or_related":0.448,"review_comments_judged":{"judged_by":["gpt-5.6-luna","grok-4.7"],"judged_against":"Pith's own text copy of each paper: text extracted from the PDF, the first 90,000 characters","measured_on":"2026-10-04","accurate":113,"decided":149,"sampled_reviews":200,"split_by_lane":false,"by_lane":"https://pith.science/accuracy#by-lane"}}}