{"id":"W2949226015","doi":"10.1145/3323165.3323182","title":"Using Time to Break Symmetry","year":2019,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rendezvous; Time complexity; Computer science; A priori and a posteriori; Graph; Node (physics); PSPACE; Task (project management); Symmetry breaking; Symmetry (geometry); Algorithm; Theoretical computer science; Mathematics; Computational complexity theory; Physics","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":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0001197021,0.00003903411,0.00005151795,0.00007373721,0.00002558366,0.0001040049,0.0003199717,0.00001729008,0.001610265],"category_scores_gemma":[0.00000765383,0.00003305185,0.00001610468,0.0003289764,0.000003368805,0.0002336774,0.0001820825,0.00002579411,0.009231832],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001573049,"about_ca_system_score_gemma":0.00002811507,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001160632,"about_ca_topic_score_gemma":3.60459e-7,"domain_scores_codex":[0.9994978,0.00001776955,0.0000648061,0.0001521563,0.0001321044,0.0001353816],"domain_scores_gemma":[0.999595,0.00001771714,0.000009640013,0.0002548168,0.00004169072,0.00008116521],"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.00001085333,0.0002439387,0.002908314,0.00005123541,0.00004883382,0.00001924701,0.001314416,0.1057312,0.04864898,0.6586158,0.08171631,0.100691],"study_design_scores_gemma":[0.000097531,0.0000309264,0.0001012624,0.000005683179,3.362291e-7,0.000006185913,0.000003462381,0.9843205,0.0007830635,0.0003119038,0.01425582,0.00008338628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004190043,0.00000337251,0.814478,0.001034601,0.00007763752,0.0001371731,2.211728e-7,0.0001244579,0.1799545],"genre_scores_gemma":[0.0857666,5.756603e-7,0.8082905,0.00432767,0.0000272208,0.000001898114,8.37647e-7,0.000008544112,0.1015761],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8785893,"threshold_uncertainty_score":0.9993024,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02393281051641785,"score_gpt":0.2749275551930601,"score_spread":0.2509947446766422,"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."}}