{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008814709,0.0009955387,0.001063173,0.001018028,0.0011207,0.002269254,0.001839721,0.002151973,0.02233309],"category_scores_gemma":[0.004665738,0.0005447434,0.001131117,0.002140925,0.001267997,0.006936201,0.002736158,0.002417644,0.002591701],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001140026,"about_ca_system_score_gemma":0.002259418,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001559843,"about_ca_topic_score_gemma":0.001694631,"domain_scores_codex":[0.9984704,0.0003304964,0.00008511933,0.0006275304,0.0002665087,0.000219944],"domain_scores_gemma":[0.9988954,0.0005792942,0.0001035399,0.0002290693,0.00009869978,0.00009391684],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001559484,0.0002350132,0.0004979373,0.0004510211,0.00006150865,0.0001415331,0.0001488797,0.0802369,0.002585116,0.7506389,0.01947119,0.1453761],"study_design_scores_gemma":[0.00004598054,0.00005897947,0.0001667028,0.00003142882,0.00003075386,0.0001839585,0.0001087847,0.1148171,0.002444099,0.8506427,0.03145172,0.00001772809],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0258254,0.0004960708,0.938664,0.00184038,0.0001552204,0.0003233138,0.001659227,0.0007215908,0.03031488],"genre_scores_gemma":[0.3220286,0.001536675,0.6418082,0.0005396407,0.0003056142,0.0005856474,0.005280416,0.0004618528,0.02745345],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02233309,"threshold_uncertainty_score":0.07471162,"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."}}