{"id":"W4281482045","doi":"10.1111/cgf.14479","title":"Fast and Exact Root Parity for Continuous Collision Detection","year":2022,"lang":"en","type":"article","venue":"Computer Graphics Forum","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China; National Science Foundation","keywords":"Parity (physics); Collision; Computer science; Root (linguistics); Collision detection; Algorithm; Parity bit; Mathematics; Physics; Particle physics","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.0009071649,0.0001465474,0.0001834883,0.0002133481,0.0008350782,0.0001793077,0.0006438451,0.00006078382,0.000001979893],"category_scores_gemma":[0.00002943509,0.0001584761,0.00009083671,0.0005404367,0.00005981774,0.0004074723,0.0007586925,0.0002390508,0.000001230318],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005354392,"about_ca_system_score_gemma":0.00002639567,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001886395,"about_ca_topic_score_gemma":0.00001903986,"domain_scores_codex":[0.9984998,0.0001745318,0.0002575081,0.0004744999,0.00027225,0.0003213881],"domain_scores_gemma":[0.999001,0.0001495381,0.0001562453,0.0005067377,0.0001032858,0.00008320649],"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.00007381554,0.0001676978,0.006013985,0.00004919193,0.00003600249,0.00000470263,0.0005131822,0.0009831948,0.0004713414,0.5815046,0.00233034,0.4078519],"study_design_scores_gemma":[0.0005880254,0.0007874284,0.01219337,0.000006652318,0.000007019,0.00006473171,0.00003563733,0.9368531,0.001700789,0.01878997,0.02872094,0.0002523535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0561255,0.0001050445,0.9410558,0.0003181552,0.001646258,0.0004938408,0.00001313248,0.0001954623,0.00004684697],"genre_scores_gemma":[0.718655,0.000009992,0.2806277,0.0004072582,0.00007625699,0.0001745011,0.00000989547,0.00001485999,0.00002460197],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9358699,"threshold_uncertainty_score":0.6462466,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.017323379184455,"score_gpt":0.2608882098943088,"score_spread":0.2435648307098538,"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."}}