{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002475509,0.0008618995,0.001800215,0.0009762001,0.001979601,0.003766816,0.003607653,0.00175896,0.008952907],"category_scores_gemma":[0.02345524,0.0009897589,0.002076063,0.001616099,0.00244735,0.007673728,0.003253737,0.003892482,0.001532095],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0029815,"about_ca_system_score_gemma":0.00223525,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004235815,"about_ca_topic_score_gemma":0.003020012,"domain_scores_codex":[0.9953603,0.001422991,0.0002358257,0.001022836,0.001155205,0.0008028744],"domain_scores_gemma":[0.9735865,0.01638236,0.002052574,0.006116586,0.0008687238,0.0009932901],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001377552,0.0003408491,0.00625342,0.0005832242,0.0002258795,0.0006756267,0.0008992709,0.4437271,0.009294862,0.434477,0.02210283,0.08004235],"study_design_scores_gemma":[0.00008208097,0.00003641449,0.0006594067,0.00001893087,0.00002670821,0.0001069323,0.0001256806,0.510254,0.001870387,0.4854695,0.001324302,0.00002566442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5653291,0.0007610195,0.4029685,0.005641175,0.000195088,0.0003849999,0.002281055,0.003544476,0.01889463],"genre_scores_gemma":[0.9178756,0.0003506408,0.07357475,0.000518044,0.0001489123,0.0003004911,0.002029773,0.0005040488,0.004697709],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008952907,"threshold_uncertainty_score":0.0299505,"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."}}