{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.008336224,0.0007726485,0.001412711,0.0002886863,0.0005538864,0.0001645685,0.001438959,0.00083136,0.00002791126],"category_scores_gemma":[0.003879488,0.0007249824,0.0006868952,0.0005451003,0.0005634964,0.00009673458,0.003157026,0.001577707,0.000001777625],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006002306,"about_ca_system_score_gemma":0.0002598875,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004005634,"about_ca_topic_score_gemma":0.00002870232,"domain_scores_codex":[0.9944243,0.0007493416,0.001724913,0.001601591,0.0005469034,0.000952922],"domain_scores_gemma":[0.9925669,0.003487478,0.0008965706,0.002166017,0.0007022895,0.0001806828],"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.0001344155,0.0006223534,0.01240547,0.003631872,0.00008020335,0.000002319541,0.006718708,0.00004243646,0.000009477102,0.974975,0.0002394891,0.001138276],"study_design_scores_gemma":[0.001111496,0.0001364802,0.001651303,0.0004502769,0.00007277226,0.000003092093,0.000128846,0.006820095,0.000361128,0.9884186,0.0001303438,0.0007155652],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9773226,0.0002090305,0.01281674,0.000123211,0.003553257,0.00390109,0.00006657451,0.0004033772,0.001604101],"genre_scores_gemma":[0.9740236,0.000007612616,0.02541927,0.00006228134,0.0001946217,0.0001465669,0.00002824055,0.0001003011,0.00001748418],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01344362,"threshold_uncertainty_score":0.9995201,"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."}}