{"id":"W4400596743","doi":"10.55016/ojs/cdm.v15i1.67935","title":"3-uniform hypergraphs: modular decomposition and realization by tournaments","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Hypergraph; Realization (probability); Mathematics; Combinatorics; Modular design; Tournament; Decomposition; Discrete mathematics; Element (criminal law); Computer science","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001080969,0.0001337259,0.0001833365,0.00004847004,0.00012421,0.00007046277,0.00009172778,0.00006201134,0.00001711308],"category_scores_gemma":[0.00006148335,0.0001302999,0.00004377568,0.0002356495,0.00002060904,0.0001261549,0.00002485017,0.00007164602,0.00003379469],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003982758,"about_ca_system_score_gemma":0.000003980796,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001551427,"about_ca_topic_score_gemma":9.571776e-7,"domain_scores_codex":[0.9993093,0.00002073382,0.0002583896,0.0001186361,0.0001141131,0.000178818],"domain_scores_gemma":[0.9995429,0.00002709797,0.00003469918,0.000138885,0.0000572331,0.0001992073],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005276169,0.0001895004,0.000449651,0.001324865,0.000610013,0.00001583713,0.01080831,0.02745029,0.3281815,0.5854787,0.04294573,0.002492848],"study_design_scores_gemma":[0.001989886,0.000335782,0.0002849454,0.0004937091,0.0002961695,0.00005641244,0.001953482,0.8662402,0.0335852,0.06452706,0.02899954,0.001237628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2032848,0.0003687039,0.7931167,0.0005776925,0.00008875478,0.0004307265,0.0004911416,0.0002937052,0.00134767],"genre_scores_gemma":[0.9983758,0.00005321307,0.001194694,0.0001179746,0.0000394695,0.00003934099,0.000137196,0.0000219729,0.00002033492],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8387899,"threshold_uncertainty_score":0.5313474,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00590559664333025,"score_gpt":0.2351990458460217,"score_spread":0.2292934492026915,"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."}}