{"id":"W3037524112","doi":"10.1609/socs.v11i1.18524","title":"New Techniques for Pairwise Symmetry Breaking in Multi-Agent Path Finding","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"University of Southern California; National Science Foundation","keywords":"Pairwise comparison; Homogeneous space; Path (computing); Context (archaeology); Computer science; Symmetry (geometry); Timeout; Symmetry breaking; Algorithm; Theoretical computer science; Mathematics; Artificial intelligence; Physics; Geometry","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.0009184407,0.0001658142,0.000215231,0.0001661339,0.000112887,0.0002465608,0.001960615,0.0001058785,0.000004042793],"category_scores_gemma":[0.0004774471,0.0001449754,0.0001394703,0.0005474547,0.00002831603,0.0003250059,0.0008029601,0.000312871,0.000003660231],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003874115,"about_ca_system_score_gemma":0.0001982121,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001251562,"about_ca_topic_score_gemma":0.000001003045,"domain_scores_codex":[0.9978748,0.00002155902,0.0003848037,0.0004787944,0.0009132945,0.0003267514],"domain_scores_gemma":[0.9986761,0.0002626977,0.0001815424,0.0001931086,0.00059951,0.00008709246],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001711564,0.001062102,0.02827174,0.0001940625,0.0001510235,0.00002601994,0.002192905,0.0004500498,0.1736988,0.7603459,0.004564571,0.0288716],"study_design_scores_gemma":[0.002920677,0.0004075285,0.004479036,0.001162204,0.00001448963,0.00004741,0.0001363626,0.0851998,0.8795759,0.02223695,0.003354076,0.0004655403],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4802926,0.0003120477,0.3649836,0.06386807,0.05397664,0.005613956,0.00009484933,0.001264371,0.02959383],"genre_scores_gemma":[0.8391007,0.00001496871,0.1594521,0.0001601839,0.0005632378,0.00006101835,0.000003637525,0.00002707816,0.0006170421],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.738109,"threshold_uncertainty_score":0.5911925,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03613716419832629,"score_gpt":0.3066897939320542,"score_spread":0.2705526297337279,"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."}}