{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003298295,0.0005407383,0.001056003,0.002974767,0.001431031,0.002634611,0.001541621,0.002217637,0.00397124],"category_scores_gemma":[0.03566073,0.0006642301,0.001050084,0.002066971,0.0065061,0.007423413,0.003411647,0.003370405,0.0004712545],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001968681,"about_ca_system_score_gemma":0.0007777917,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009763314,"about_ca_topic_score_gemma":0.0005225729,"domain_scores_codex":[0.9938864,0.002167057,0.0002850941,0.001482363,0.001541274,0.00063778],"domain_scores_gemma":[0.9537617,0.03191865,0.003871316,0.005350817,0.003640684,0.001456808],"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.0001260124,0.00003692634,0.00315646,0.0001308956,0.00003212606,0.0002861885,0.0004914561,0.01637441,0.005315319,0.9607129,0.001630617,0.01170665],"study_design_scores_gemma":[0.00002515647,0.00008184191,0.0014074,0.00004934402,0.00002142418,0.0002928376,0.0001931499,0.0905256,0.003703895,0.8995575,0.0040965,0.00004532361],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3387819,0.001325508,0.6201043,0.002744961,0.0002050707,0.0002414287,0.0009745812,0.0004185977,0.03520368],"genre_scores_gemma":[0.9521537,0.0007151245,0.04142112,0.0006437971,0.0005689373,0.0002387098,0.0005656834,0.000138579,0.003554462],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00397124,"threshold_uncertainty_score":0.0174433,"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."}}