{"id":"W2550851713","doi":"10.1002/jgt.22414","title":"Generating near‐bipartite bricks","year":2018,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Combinatorics; Brick; Vertex (graph theory); Mathematics; Complete bipartite graph; Matching (statistics); Graph; Discrete mathematics; Composite material; Materials 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.0006432161,0.0003434606,0.0003200736,0.000827777,0.0007774516,0.0005752367,0.0007892445,0.0006513859,0.0105653],"category_scores_gemma":[0.002905885,0.000444359,0.0007097201,0.0004393432,0.001022132,0.001005138,0.00226989,0.0009452939,0.001371553],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004085758,"about_ca_system_score_gemma":0.0002387101,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004079434,"about_ca_topic_score_gemma":0.0008512942,"domain_scores_codex":[0.9993715,0.0002083139,0.0000179425,0.0001278037,0.0001955124,0.00007894022],"domain_scores_gemma":[0.998742,0.0005601961,0.00009636487,0.0003033341,0.0002014964,0.00009663111],"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.0001994849,0.0001307696,0.001983213,0.0003550821,0.00005248046,0.0005243497,0.0008355575,0.03612107,0.03840961,0.8348134,0.009353116,0.07722197],"study_design_scores_gemma":[0.0001342667,0.0002445771,0.001560473,0.0001295591,0.00005595183,0.000694715,0.0004132897,0.1629917,0.02614317,0.772746,0.03482872,0.00005740238],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2345101,0.0003310508,0.7178501,0.0005509201,0.0001654441,0.0003315385,0.0004516763,0.000858022,0.04495121],"genre_scores_gemma":[0.7543635,0.0001978373,0.2198564,0.000278378,0.0000428599,0.000288153,0.0007814306,0.0003758897,0.02381548],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0105653,"threshold_uncertainty_score":0.03534448,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02844527706474328,"score_gpt":0.3126609190355152,"score_spread":0.284215641970772,"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."}}