{"id":"W2163453622","doi":"10.1002/rsa.10058","title":"On characterizing hypergraph regularity","year":2002,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":18,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hypergraph; Lemma (botany); Verifiable secret sharing; Mathematics; Bipartite graph; Discrete mathematics; Combinatorics; Graph; Randomness; Computer science","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002758988,0.0002866463,0.0004376887,0.0001179532,0.00052723,0.00008109763,0.0001839881,0.000153095,0.0004285537],"category_scores_gemma":[0.0002271215,0.0002004998,0.0001597343,0.0001247047,0.0001638314,0.00009176335,0.00008301184,0.0002942935,0.000002704022],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001294035,"about_ca_system_score_gemma":0.00000319921,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001677678,"about_ca_topic_score_gemma":0.000002824654,"domain_scores_codex":[0.998552,0.0001059952,0.0002904967,0.0003735723,0.0002805138,0.0003974827],"domain_scores_gemma":[0.99884,0.0004622117,0.0001182291,0.0003878298,0.0000347225,0.0001570326],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001846571,0.00004758693,0.0003209545,0.00008604346,0.0001309058,0.00003222499,0.001034539,0.000001843725,0.0005861997,0.9391757,0.002162949,0.05623639],"study_design_scores_gemma":[0.003410773,0.0001035827,0.002988483,0.00003780416,0.00005477984,0.0001054574,0.00003748443,0.001247917,0.0008807263,0.9858214,0.004957921,0.0003537341],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9924388,0.0008470598,0.0005517511,0.0003209671,0.0007404829,0.0003261188,0.00003777337,0.0001525728,0.004584471],"genre_scores_gemma":[0.9937751,0.0002784702,0.004641911,0.0004717494,0.000343491,0.00001095275,0.000004149138,0.00003536597,0.0004387973],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05588265,"threshold_uncertainty_score":0.8176146,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02915583934880907,"score_gpt":0.2610700706186652,"score_spread":0.2319142312698561,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}