{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004375481,0.0001848854,0.0002475605,0.0006547334,0.0004796823,0.0004950556,0.000543299,0.0004516859,0.005157607],"category_scores_gemma":[0.001790508,0.000315748,0.0003813485,0.0003310898,0.0008046512,0.0007752743,0.001567215,0.0004871285,0.0005374411],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002770157,"about_ca_system_score_gemma":0.0001706255,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001999364,"about_ca_topic_score_gemma":0.0004046836,"domain_scores_codex":[0.9996632,0.00009180862,0.00001295288,0.00005848029,0.0001242581,0.00004925948],"domain_scores_gemma":[0.9992162,0.0003106021,0.00008757851,0.0001804284,0.0001283642,0.00007684495],"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.0001267638,0.00009787337,0.002194885,0.0001879105,0.00002794881,0.0004751645,0.0007197471,0.02034229,0.04054997,0.8909265,0.002972815,0.04137816],"study_design_scores_gemma":[0.0001088124,0.0002423726,0.002536641,0.0001153238,0.00004204191,0.001111136,0.0005985068,0.172423,0.04439354,0.7518092,0.02656957,0.00004983976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.540695,0.0002110059,0.4256586,0.0002279567,0.00008766491,0.0001568192,0.00017373,0.0003327719,0.03245641],"genre_scores_gemma":[0.9192324,0.00008423893,0.07158641,0.00007288708,0.00001700331,0.00009862891,0.0002118354,0.00008369593,0.008612824],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005157607,"threshold_uncertainty_score":0.01725394,"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."}}