{"id":"W1726430263","doi":"10.1007/978-3-540-89020-1_16","title":"Code Graph Transformations for Verifiable Generation of SIMD-Parallel Assembly Code","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Manufacturing Process and Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; SIMD; Parallel computing; Code generation; Code (set theory); Programming language; Graph; Verifiable secret sharing; Theoretical computer science; Operating system","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.0006598819,0.0009265433,0.0003950124,0.0009800821,0.0006042494,0.0008206595,0.00130624,0.0009058491,0.007475361],"category_scores_gemma":[0.00315962,0.0005631485,0.0009074234,0.0006677811,0.001491118,0.001418028,0.00151216,0.001663756,0.001689256],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008713291,"about_ca_system_score_gemma":0.001234043,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002363161,"about_ca_topic_score_gemma":0.002844308,"domain_scores_codex":[0.998711,0.0002882508,0.0000569514,0.0002264378,0.0005674764,0.0001500241],"domain_scores_gemma":[0.9972262,0.001315206,0.0001762588,0.0009252297,0.0003183235,0.00003875068],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0008683632,0.0003018765,0.001179701,0.0005151333,0.00008546343,0.0008048617,0.0003892419,0.1158983,0.103163,0.1814476,0.0208038,0.5745427],"study_design_scores_gemma":[0.0001426013,0.000174391,0.000478097,0.00007757294,0.00005738967,0.000322371,0.00005327394,0.5793663,0.2279382,0.1700194,0.0213151,0.00005545819],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02382321,0.0001855686,0.9509678,0.0003030235,0.0001210065,0.000203051,0.0003539256,0.01622252,0.007819882],"genre_scores_gemma":[0.4935062,0.0003227238,0.4907127,0.0003667176,0.00009070295,0.0003531694,0.001452705,0.003825841,0.00936908],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007475361,"threshold_uncertainty_score":0.02500755,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02444258836568365,"score_gpt":0.2285566186030836,"score_spread":0.2041140302374,"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."}}