{"id":"W2132648308","doi":"10.1109/spdp.1990.143503","title":"The maximum weight perfect matching problem for complete weighted graphs is in PC","year":2002,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Speedup; Combinatorics; Matching (statistics); Mathematics; Computation; Time complexity; Parallel algorithm; Minimum weight; Graph; Binary logarithm; Running time; Algorithm; Discrete mathematics; Computer science; Parallel computing","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.0004854648,0.0002115438,0.000214372,0.0001728687,0.0006507596,0.0003634969,0.001442906,0.000060091,0.0001343906],"category_scores_gemma":[0.000008763759,0.0001439532,0.0001860049,0.0007774332,0.0001048844,0.0003697106,0.0002869711,0.0002260412,0.00006377682],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003101874,"about_ca_system_score_gemma":0.00001345194,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001071667,"about_ca_topic_score_gemma":0.0001751293,"domain_scores_codex":[0.9981861,0.00008411744,0.000363302,0.0004956303,0.0002946443,0.0005762019],"domain_scores_gemma":[0.9986231,0.0004780305,0.00008137242,0.0006687281,0.00006544425,0.00008327985],"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.000008220395,0.0001327466,0.0003365875,0.00003160342,0.0000345944,0.00000841082,0.001971989,0.00001064176,0.0001346441,0.8425503,0.01247062,0.1423096],"study_design_scores_gemma":[0.0005708521,0.00009007742,0.0003276846,0.00002712203,0.000003737246,0.00001747806,0.0000438741,0.2847772,0.000252732,0.6408788,0.0727559,0.0002545024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01250277,0.001135591,0.923452,0.02398611,0.001096793,0.001668323,0.00002604643,0.0006140771,0.03551833],"genre_scores_gemma":[0.426338,0.0004910334,0.5637742,0.004419197,0.0002148563,0.0003979973,0.000008161904,0.00005734161,0.004299229],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4138352,"threshold_uncertainty_score":0.5870239,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03078141394729043,"score_gpt":0.2368455153117809,"score_spread":0.2060641013644904,"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."}}