{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001399314,0.0002258022,0.0002634344,0.0003341797,0.0001315077,0.00006158632,0.0003336621,0.0001868601,0.00000909056],"category_scores_gemma":[0.00001218854,0.0002248727,0.00007281614,0.0001415321,0.0001151684,0.0002632248,0.0000219068,0.0001823887,0.000001670048],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007034262,"about_ca_system_score_gemma":0.00008701762,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005088772,"about_ca_topic_score_gemma":0.00008260406,"domain_scores_codex":[0.9988665,0.000003496686,0.0003434648,0.0002923414,0.0002654563,0.0002287646],"domain_scores_gemma":[0.9994288,0.0000702153,0.00008197111,0.0002441636,0.0001287101,0.00004615371],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000281556,0.000005304738,0.00000104773,0.0001345546,0.000007247033,4.345267e-7,0.0003252519,0.9774467,0.0002569802,0.0003341042,0.0001298199,0.0213557],"study_design_scores_gemma":[0.0002011825,0.000052579,0.000006773926,0.00008919657,0.000009432284,0.000004763178,7.254948e-8,0.9794425,0.01434448,0.002774604,0.002833714,0.000240642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001864473,0.0003811228,0.9966232,0.00003894222,0.0005101222,0.0003697926,0.00005046606,0.00009105053,0.001748814],"genre_scores_gemma":[0.4042042,0.001345637,0.5932659,0.0001815521,0.0004118948,0.00005468666,0.0001966269,0.00008447119,0.0002550021],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4040178,"threshold_uncertainty_score":0.9170043,"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."}}