{"id":"W1543181490","doi":"10.1007/978-3-540-73556-4_6","title":"Searching Cycle-Disjoint Graphs","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Regina","funders":"","keywords":"Combinatorics; Disjoint sets; Computer science; Graph; Time complexity; Vertex (graph theory); Running time; Mathematics; Discrete mathematics; Algorithm","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.002123608,0.0007126622,0.0006584503,0.002239519,0.0005852316,0.0009103005,0.005754197,0.0003729176,0.00004474386],"category_scores_gemma":[0.00009616483,0.0006816713,0.0003202216,0.001406989,0.001404474,0.0007882812,0.00297205,0.001832184,0.00009060207],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002896714,"about_ca_system_score_gemma":0.000489109,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007777414,"about_ca_topic_score_gemma":0.0001923098,"domain_scores_codex":[0.9940795,0.00004921161,0.0007209412,0.002099247,0.001795072,0.001256047],"domain_scores_gemma":[0.9962075,0.0007499749,0.0002886016,0.002130399,0.0002570438,0.0003664353],"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.000003064614,0.00002588117,0.00001556647,0.00002450519,0.00001025293,0.0001792153,0.0004689615,0.006304016,0.00002702928,0.267244,0.000008465089,0.7256891],"study_design_scores_gemma":[0.0001815689,0.0001171938,0.0001173591,0.0003204486,0.000004437387,0.0001251895,1.431012e-7,0.3140184,0.0003952882,0.6819047,0.002130907,0.000684301],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00007769763,0.0005104035,0.9768788,0.0005723506,0.002557359,0.0003713309,0.000004755908,0.00036136,0.018666],"genre_scores_gemma":[0.0549556,0.00009496795,0.941342,0.002433544,0.0007337556,0.000007779273,0.000006782104,0.00006515207,0.000360431],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7250048,"threshold_uncertainty_score":0.9996251,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03334642201468271,"score_gpt":0.2770830695380785,"score_spread":0.2437366475233958,"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."}}