{"id":"W4408337137","doi":"10.1002/rsa.21270","title":"Perfect Matchings and Loose Hamilton Cycles in the Semirandom Hypergraph Model","year":2025,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hypergraph; Combinatorics; Mathematics; 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.0007617205,0.000311739,0.0005233046,0.0001937588,0.0004879619,0.0001388585,0.000271453,0.0001580435,0.000008657834],"category_scores_gemma":[0.0001359421,0.0001782621,0.0001286019,0.0002132583,0.00026717,0.0001017185,0.0001119475,0.0003835685,1.084109e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001051358,"about_ca_system_score_gemma":0.00001780851,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004025584,"about_ca_topic_score_gemma":0.00002834071,"domain_scores_codex":[0.9985012,0.0002101641,0.000361943,0.0003815669,0.0002288441,0.0003163088],"domain_scores_gemma":[0.9984387,0.001051575,0.00008469172,0.0003423749,0.00002881046,0.00005389197],"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.001286784,0.00006847335,0.002668116,0.0005129487,0.000246544,0.00003593432,0.01661651,0.0002876321,0.0007566643,0.9034089,0.001284179,0.07282732],"study_design_scores_gemma":[0.00704455,0.0000259022,0.003106186,0.0000742959,0.00009854283,0.00005757713,0.0004273025,0.01358848,0.000182685,0.9749137,0.00025501,0.0002257426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9889355,0.004380927,0.003517436,0.0003147037,0.000201864,0.0005824541,0.00002637399,0.00005176522,0.001989017],"genre_scores_gemma":[0.9925272,0.001067326,0.005486758,0.000622081,0.00007478268,0.0000315112,0.000003862212,0.00002048235,0.0001659674],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.07260158,"threshold_uncertainty_score":0.7269319,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01519732881876633,"score_gpt":0.2933612278799123,"score_spread":0.2781638990611459,"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."}}