{"id":"W2982703654","doi":"10.4230/lipics.disc.2019.26","title":"The Complexity of Symmetry Breaking in Massive Graphs","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Omega; Combinatorics; Upper and lower bounds; Symmetry breaking; Graph; Algorithm; Mathematics; Time complexity; Discrete mathematics; Physics; Particle physics; Mathematical analysis","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.00117168,0.0003005195,0.0004483766,0.0003713797,0.0002197699,0.0002499025,0.002241137,0.0001626049,0.000006297432],"category_scores_gemma":[0.000155324,0.000233452,0.0002386886,0.0007628417,0.0002681468,0.00119801,0.0007949011,0.0005024135,0.00004397309],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001370201,"about_ca_system_score_gemma":0.00008016105,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009234073,"about_ca_topic_score_gemma":0.0001079177,"domain_scores_codex":[0.9973096,0.00007191786,0.001148308,0.0002683195,0.0005245493,0.0006773561],"domain_scores_gemma":[0.9972058,0.0004510549,0.0007179892,0.001252712,0.00028589,0.00008658965],"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":[0.0001316466,0.0003647931,0.1017726,0.0008693256,0.0001557175,0.000006229312,0.0149892,0.0001315749,0.0004594332,0.8340592,0.002062361,0.04499794],"study_design_scores_gemma":[0.008750031,0.002197399,0.05109835,0.002280137,0.00006751606,0.0002258416,0.008481819,0.6277354,0.03123499,0.2307858,0.03420878,0.002933962],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8040632,0.00009571014,0.1728906,0.0009504159,0.002258824,0.002625128,0.0001086848,0.0006233482,0.01638413],"genre_scores_gemma":[0.9628048,0.00001820472,0.03670997,0.0002688417,0.00002005628,0.0000572695,0.00002135704,0.00002366567,0.00007582305],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6276038,"threshold_uncertainty_score":0.9519894,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02223674272963165,"score_gpt":0.2679257782581049,"score_spread":0.2456890355284733,"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."}}