{"id":"W2133768373","doi":"10.1109/sfcs.1996.548466","title":"The optimal path-matching problem","year":2002,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Time complexity; Mathematics; Combinatorics; Generalization; Intersection (aeronautics); Weighted matroid; Equivalence (formal languages); Path (computing); Matching (statistics); Context (archaeology); Polynomial; Discrete mathematics; Matroid partitioning; Computer science; Graphic matroid","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.0002003431,0.00006832464,0.00005294921,0.00002054035,0.0004682965,0.0003279686,0.0009195349,0.00001883875,0.00006988657],"category_scores_gemma":[0.000006832791,0.00004181935,0.00004980551,0.0002063841,0.00004705824,0.0002530744,0.000273525,0.0001152496,0.0001536648],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007651584,"about_ca_system_score_gemma":0.000004982101,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001827382,"about_ca_topic_score_gemma":0.000004625254,"domain_scores_codex":[0.9992807,0.00002971358,0.000114555,0.000174826,0.0001786517,0.000221568],"domain_scores_gemma":[0.9993918,0.0001281851,0.00002603725,0.0003862325,0.00002347817,0.00004428809],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[2.504171e-7,0.00002445514,0.00001256921,0.000001635942,0.000005421706,0.000005158093,0.0006523585,0.0001161351,0.0000233143,0.7897387,0.006992161,0.2024278],"study_design_scores_gemma":[0.0001619206,0.00005967542,0.0001771114,0.00001114079,0.000001672362,0.00004133817,0.00008443945,0.6738853,0.0002154172,0.1619671,0.1631864,0.00020843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001563564,0.0002769633,0.926607,0.005427614,0.0002768238,0.00009345292,3.427504e-7,0.0002865354,0.06546766],"genre_scores_gemma":[0.2762745,0.0001010917,0.7154453,0.0008496951,0.0001224183,0.000020055,2.463271e-7,0.000007753394,0.007178929],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6737692,"threshold_uncertainty_score":0.3601806,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0223988698109228,"score_gpt":0.2207498396592447,"score_spread":0.1983509698483219,"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."}}