{"id":"W3026418435","doi":"10.1002/jgt.22579","title":"Generating simple near-bipartite bricks","year":2017,"lang":"","type":"article","venue":"ArXiv.org","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"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; Mathematics; Brick; Complete bipartite graph; Matching (statistics); Vertex (graph theory); 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.0004835012,0.0003150108,0.0002779692,0.0006641615,0.0005845668,0.0005304999,0.0007405141,0.0005679877,0.006424038],"category_scores_gemma":[0.002323027,0.0003999504,0.0005358508,0.0004308724,0.0007529552,0.0009442236,0.002256189,0.0007068006,0.001102181],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003427777,"about_ca_system_score_gemma":0.0002689673,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002877879,"about_ca_topic_score_gemma":0.0007231895,"domain_scores_codex":[0.9995363,0.0001100205,0.00001693794,0.00009028592,0.0001686525,0.00007792379],"domain_scores_gemma":[0.9991544,0.0003120406,0.0000900542,0.0002222711,0.0001424592,0.00007877006],"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.0001670443,0.0001353039,0.003309537,0.0003117336,0.00004137208,0.0006995331,0.001018494,0.02602955,0.05447213,0.8251191,0.006713481,0.08198264],"study_design_scores_gemma":[0.0001649469,0.0003772929,0.003072583,0.0001748455,0.00007193191,0.001669379,0.0008015083,0.2043967,0.05974432,0.6748673,0.05457664,0.00008264474],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.382467,0.0002780803,0.5642231,0.0004292239,0.0001275891,0.0003350858,0.0004449469,0.0006431828,0.05105186],"genre_scores_gemma":[0.8288546,0.0001882987,0.1539143,0.0001999074,0.00002985248,0.0002913197,0.0008007133,0.0001852866,0.0155356],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006424038,"threshold_uncertainty_score":0.02149057,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08692357924479878,"score_gpt":0.35217860214298,"score_spread":0.2652550228981812,"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."}}