{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005489826,0.001400659,0.001270077,0.001515613,0.0009911705,0.002298396,0.001895659,0.001387029,0.01269927],"category_scores_gemma":[0.002727705,0.0007817016,0.001660141,0.002373315,0.0005966435,0.003524942,0.003389473,0.002808803,0.00393457],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008082141,"about_ca_system_score_gemma":0.001233822,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001241641,"about_ca_topic_score_gemma":0.002128732,"domain_scores_codex":[0.9993149,0.0001217442,0.00005570347,0.0001886575,0.0001944192,0.0001245883],"domain_scores_gemma":[0.9987425,0.0003770686,0.00009447339,0.0003990522,0.0002852819,0.0001016999],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0004615401,0.0004313978,0.001201162,0.0006438309,0.0001043367,0.0003530761,0.0005761298,0.03757203,0.02894511,0.1105564,0.02829649,0.7908585],"study_design_scores_gemma":[0.0004108564,0.0004420804,0.0007621409,0.0001129721,0.000185337,0.0007498171,0.0007661906,0.6257342,0.01944557,0.3148894,0.03639271,0.0001087363],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02736017,0.000146942,0.9626572,0.000270778,0.0000932968,0.0002243324,0.0005621909,0.00386536,0.004819728],"genre_scores_gemma":[0.1314158,0.0001812597,0.8591008,0.000117197,0.00005312275,0.0003560786,0.002623686,0.000618535,0.005533404],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01269927,"threshold_uncertainty_score":0.04248333,"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."}}