{"id":"W2248358623","doi":"10.4230/lipics.csl.2011.381","title":"A Formal Theory for the Complexity Class Associated with the Stable Marriage Problem","year":2011,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Complexity class; Bipartite graph; Mathematical proof; Lexicographical order; Mathematics; Class (philosophy); Discrete mathematics; Completeness (order theory); Matching (statistics); Computational complexity theory; Computer science; Combinatorics; Time complexity; Theoretical computer science; Graph; Algorithm; Artificial intelligence","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.003365856,0.001256893,0.001204675,0.005810096,0.003445356,0.00782432,0.002391624,0.002893085,0.009780791],"category_scores_gemma":[0.01037326,0.0006998409,0.002950914,0.006242084,0.009108367,0.01702978,0.005180905,0.009651416,0.001165556],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005382829,"about_ca_system_score_gemma":0.002205435,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002486897,"about_ca_topic_score_gemma":0.001228156,"domain_scores_codex":[0.9961493,0.0008241675,0.0003702569,0.0007926878,0.001362396,0.0005011575],"domain_scores_gemma":[0.9901915,0.006800571,0.0006508065,0.0008896794,0.001006317,0.0004612726],"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.00000605619,0.00001555976,0.00008311192,0.0000423478,0.000004171494,0.00002088269,0.0001060371,0.0007336224,0.0001309376,0.9941743,0.001074132,0.003608933],"study_design_scores_gemma":[0.00001466714,0.00001825853,0.0001802418,0.00002306105,0.000007734945,0.00009516672,0.00008008417,0.005687859,0.0002897334,0.9843377,0.009247535,0.00001779681],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04367293,0.003691541,0.8540494,0.009506593,0.0006928492,0.0004901421,0.001856489,0.0005129161,0.08552703],"genre_scores_gemma":[0.6398875,0.003976322,0.3205652,0.003963637,0.002777504,0.002721631,0.003319426,0.0003757489,0.02241298],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009780791,"threshold_uncertainty_score":0.03905541,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05563470749985124,"score_gpt":0.2694607798329779,"score_spread":0.2138260723331267,"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."}}