{"id":"W1763401657","doi":"10.1007/3-540-45471-3_21","title":"A Polynomial Time Algorithm to Find the Minimum Cycle Basis of a Regular Matroid","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Matroid; Graphic matroid; Matroid partitioning; Combinatorics; Mathematics; Time complexity; Basis (linear algebra); Cycle basis; Discrete mathematics; Matrix (chemical analysis); Matrix multiplication; Oriented 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":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00137172,0.0005260508,0.0006404864,0.001088205,0.0003071075,0.0003208682,0.006760634,0.0002569811,0.00009158018],"category_scores_gemma":[0.000127483,0.0004059112,0.0002324467,0.001423936,0.001298695,0.0004280879,0.002754487,0.0008241395,0.0002038523],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002215251,"about_ca_system_score_gemma":0.0002820106,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001446909,"about_ca_topic_score_gemma":0.000006320032,"domain_scores_codex":[0.9952292,0.0001029027,0.0005992829,0.001545953,0.001590845,0.0009318516],"domain_scores_gemma":[0.9957306,0.0009446366,0.0002773983,0.00247997,0.0003037002,0.0002637066],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001432387,0.00003659746,0.000003467597,0.0000177613,0.0000190869,0.0000596373,0.0009114219,0.01078147,0.001182794,0.002490711,0.0003614457,0.9841213],"study_design_scores_gemma":[0.0004270977,0.0005586248,0.00009816597,0.0003440623,0.00001217378,0.0001449168,3.863827e-7,0.8708848,0.007398197,0.1140305,0.005235521,0.0008655422],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001894675,0.0003373713,0.9941459,0.00206099,0.0004826146,0.0006798648,0.00002155442,0.00008620668,0.001995982],"genre_scores_gemma":[0.01548126,0.0000336358,0.9776181,0.001574514,0.0006012329,0.00003064704,0.000002788028,0.00007505472,0.004582779],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9832557,"threshold_uncertainty_score":0.9998392,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01206932577443784,"score_gpt":0.2476371203445412,"score_spread":0.2355677945701034,"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."}}