{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001602003,0.0005487626,0.0005697655,0.0001416735,0.006346974,0.003030346,0.00540695,0.0002371255,0.0004060777],"category_scores_gemma":[0.001544269,0.0005782102,0.0003139759,0.0004882745,0.001354579,0.003037861,0.003816917,0.000996392,0.002475329],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001180564,"about_ca_system_score_gemma":0.0004165554,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002385586,"about_ca_topic_score_gemma":0.00009600368,"domain_scores_codex":[0.9944562,0.0003928408,0.0007524283,0.001604126,0.0009006084,0.00189374],"domain_scores_gemma":[0.9925901,0.0002946411,0.0006704634,0.005324977,0.0004459668,0.0006738569],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.00005706611,0.0002121187,0.8187441,0.00006890929,0.0001256578,0.0003564217,0.001800106,0.002061625,0.02660748,0.008951256,0.00111119,0.1399041],"study_design_scores_gemma":[0.00190904,0.000568368,0.4747723,0.0001929369,0.00004687584,0.00006950554,0.0001083164,0.4493015,0.02283388,0.01278523,0.03573081,0.00168131],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8999574,0.0008313354,0.09282636,0.00166311,0.001170089,0.0004626383,0.00001295273,0.0001577614,0.002918368],"genre_scores_gemma":[0.9855455,0.0001394795,0.008666938,0.0006192455,0.0008313225,0.00004067082,0.000004283275,0.00007130711,0.00408123],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4472398,"threshold_uncertainty_score":0.9999743,"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."}}