{"id":"W2294850962","doi":"10.1007/s13160-016-0209-9","title":"A fast algorithm to construct a representation for transversal matroids","year":2016,"lang":"en","type":"article","venue":"Japan Journal of Industrial and Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Transversal (combinatorics); Matroid; Bipartite graph; Mathematics; Oriented matroid; Combinatorics; Weighted matroid; Algorithm; Discrete mathematics; Matrix (chemical analysis); Matroid partitioning; Graphic matroid; Graph","routes":{"ca_aff":true,"ca_fund":false,"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":[],"consensus_categories":[],"category_scores_codex":[0.0006685606,0.0001136188,0.000285509,0.0001755709,0.00007593266,0.00008142171,0.0004003549,0.0000726365,0.000007300915],"category_scores_gemma":[0.0001575139,0.00007083305,0.0000794551,0.0002438238,0.00008512667,0.0002251651,0.00006570855,0.000131352,0.000003490446],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002827598,"about_ca_system_score_gemma":0.00007566993,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":2.394476e-7,"about_ca_topic_score_gemma":1.589818e-7,"domain_scores_codex":[0.9988327,0.00002228662,0.0004635538,0.0001554001,0.00030449,0.0002215492],"domain_scores_gemma":[0.9987245,0.0005099875,0.0002529168,0.0001831612,0.0001353229,0.0001941397],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001334772,0.00005437326,0.00001496121,0.00001450228,0.00004844219,0.000003159177,0.001162159,0.0000115271,0.02965059,0.1600259,0.000471748,0.8084092],"study_design_scores_gemma":[0.01493409,0.001962485,0.00003382513,0.0005507008,0.00008997029,0.0007697172,0.003879092,0.002322245,0.1202029,0.8526502,0.001963052,0.0006416609],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06281272,0.000007489858,0.9354713,0.0009948593,0.0001403576,0.0003674783,0.00001245398,0.00001527917,0.0001780607],"genre_scores_gemma":[0.1189704,0.00001024695,0.8804416,0.000050788,0.000394665,0.00002294805,2.986054e-7,0.00001564253,0.00009335747],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8077675,"threshold_uncertainty_score":0.2888488,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05063648421488117,"score_gpt":0.301734935331679,"score_spread":0.2510984511167978,"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."}}