{"id":"W2611912062","doi":"10.1002/jgt.22579","title":"Generating simple near‐bipartite bricks","year":2020,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Fundação de Apoio ao Desenvolvimento do Ensino, Ciência e Tecnologia do Estado de Mato Grosso do Sul; University of Waterloo; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Bipartite graph; Combinatorics; Brick; Mathematics; Matching (statistics); Vertex (graph theory); Complete bipartite graph; Simple (philosophy); Class (philosophy); Discrete mathematics; Graph; 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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002696873,0.0004808393,0.00109967,0.0002773384,0.0004085192,0.0002270049,0.001059363,0.0004292642,0.0002983852],"category_scores_gemma":[0.001625615,0.0003709991,0.001183754,0.0002285723,0.0003006468,0.0001282938,0.0009261116,0.00223826,0.000004522022],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005303208,"about_ca_system_score_gemma":0.0002271813,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002996695,"about_ca_topic_score_gemma":0.000001876111,"domain_scores_codex":[0.9963583,0.0007742619,0.001447909,0.0003505591,0.0006730852,0.0003959078],"domain_scores_gemma":[0.9955205,0.001046555,0.002077844,0.0006833304,0.000380605,0.0002911961],"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.0005372421,0.000152069,0.0006579921,0.0008052621,0.001770528,0.0003944412,0.008666281,0.001655998,0.001494964,0.9499452,0.0242456,0.009674456],"study_design_scores_gemma":[0.0004383902,0.0001393778,0.0001342222,0.0002583576,0.0003856816,0.0001589885,0.00028907,0.0003833346,0.0005046381,0.994162,0.002761732,0.0003842042],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9492852,0.003844017,0.03799512,0.000480846,0.003870536,0.0004074304,0.00007012597,0.0001157073,0.003931002],"genre_scores_gemma":[0.9577973,0.0002596847,0.03876122,0.0009302613,0.001983145,0.000006378095,0.000006912521,0.0001213259,0.0001337494],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04421683,"threshold_uncertainty_score":0.9998742,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04818887010152319,"score_gpt":0.3168964226717651,"score_spread":0.2687075525702419,"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."}}