{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002094679,0.0006238358,0.001037772,0.001764303,0.0006782277,0.00187894,0.001942945,0.0008484259,0.005137042],"category_scores_gemma":[0.01739015,0.0004360566,0.0003969943,0.001001904,0.001734259,0.002591872,0.002921025,0.001444193,0.0009424373],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001423037,"about_ca_system_score_gemma":0.002624194,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002299127,"about_ca_topic_score_gemma":0.001684757,"domain_scores_codex":[0.9961981,0.000793421,0.0001679265,0.0004497461,0.001976194,0.0004145773],"domain_scores_gemma":[0.9899187,0.005412287,0.0007080649,0.002282209,0.001364647,0.0003140981],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.002276575,0.0002715893,0.01280724,0.0004241893,0.0001157262,0.0004092023,0.0004984905,0.2717479,0.04909331,0.1610628,0.00876074,0.4925322],"study_design_scores_gemma":[0.00009269707,0.0001325975,0.0004961911,0.00003167368,0.00001407883,0.0001489457,0.00004841059,0.9283032,0.02542763,0.04245275,0.002810913,0.00004095437],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06664697,0.0003160377,0.922529,0.0002307909,0.0001329859,0.0001094791,0.0002217601,0.006197094,0.003616001],"genre_scores_gemma":[0.736893,0.00006956895,0.2606848,0.0001362463,0.00003657254,0.00009784688,0.0002244998,0.000380831,0.001476623],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005137042,"threshold_uncertainty_score":0.01718515,"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."}}