{"id":"W2581287304","doi":"10.1017/s0963548318000147","title":"A Stability Theorem for Matchings in Tripartite 3-Graphs","year":2018,"lang":"en","type":"preprint","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hypergraph; Combinatorics; Mathematics; Matching (statistics); Stability (learning theory); Degree (music); Statement (logic); Class (philosophy); Discrete mathematics; Upper and lower bounds; Computer science; Physics; Law","routes":{"ca_aff":true,"ca_fund":false,"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.0007993885,0.0003426459,0.0004755945,0.001551475,0.001462641,0.001615514,0.001108847,0.0009348624,0.006368206],"category_scores_gemma":[0.005351171,0.0002929544,0.0006572914,0.001190753,0.001886835,0.003338451,0.001828307,0.001481289,0.001013594],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001121585,"about_ca_system_score_gemma":0.0002976056,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008450642,"about_ca_topic_score_gemma":0.0004927647,"domain_scores_codex":[0.9994441,0.0000953175,0.00002675588,0.0001930293,0.0001674427,0.00007334626],"domain_scores_gemma":[0.9971685,0.001487867,0.000371067,0.0002359367,0.0004615549,0.0002750771],"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.00008933755,0.00002697463,0.001279833,0.00009931608,0.00002955535,0.0001595248,0.0005209384,0.008006377,0.007651604,0.9640967,0.002732567,0.01530719],"study_design_scores_gemma":[0.00001229741,0.0000368984,0.0007461275,0.00001653024,0.0000101822,0.0002116127,0.00009535378,0.04223174,0.002556944,0.9510069,0.003057228,0.00001815198],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5096905,0.001019564,0.4340649,0.002378936,0.000124868,0.0001022904,0.0006928365,0.000660412,0.05126571],"genre_scores_gemma":[0.9644665,0.0003799213,0.02757641,0.0003915248,0.0001645476,0.0001446166,0.0003099364,0.0001097148,0.006456945],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006368206,"threshold_uncertainty_score":0.02130383,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07684350629081063,"score_gpt":0.3259997168211511,"score_spread":0.2491562105303405,"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."}}