{"id":"W2016263640","doi":"10.1145/2635822","title":"The complexity of the comparator circuit value problem","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Seventh Framework Programme; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Complexity class; Combinatorics; Bipartite graph; Conjecture; Discrete mathematics; Class (philosophy); P; Comparator; Oracle; Time complexity; Graph; Computer science","routes":{"ca_aff":true,"ca_fund":true,"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.0010853,0.0001624665,0.0001806057,0.0000812461,0.001158672,0.0001288776,0.002066155,0.00004930772,0.00001395725],"category_scores_gemma":[0.00005799959,0.0001050347,0.0002020495,0.0006601175,0.0007917694,0.0001773887,0.00005303015,0.0002989203,0.00002963177],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000346815,"about_ca_system_score_gemma":0.00006404733,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001781061,"about_ca_topic_score_gemma":0.00001853571,"domain_scores_codex":[0.9978707,0.0008022533,0.0003741046,0.0003016151,0.0004185614,0.000232771],"domain_scores_gemma":[0.9967499,0.001698798,0.0001978047,0.001143305,0.0001496066,0.00006052677],"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.00001052416,0.00009734368,0.000008246813,0.000009710499,0.00003121136,9.96914e-8,0.0004305709,0.01695308,0.00005023359,0.8453132,0.0000736931,0.1370221],"study_design_scores_gemma":[0.0002876801,0.00007904666,0.001738594,0.0000266958,0.00001327665,0.00000994139,0.00005138722,0.1160092,0.001569792,0.8787436,0.001348616,0.0001221812],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002292408,0.00003420248,0.9921355,0.002555746,0.00075673,0.0003010252,0.000008114122,0.0001415249,0.001774793],"genre_scores_gemma":[0.9657438,0.00000497516,0.03357435,0.0004698028,0.0000337436,0.00002473984,0.000001262106,0.00001006018,0.0001372541],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9634514,"threshold_uncertainty_score":0.8911685,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04217450054507668,"score_gpt":0.2620574507414464,"score_spread":0.2198829501963697,"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."}}