{"id":"W1581970913","doi":"10.1109/pact.1996.554031","title":"Using the parallel complexity of programs to improve compaction","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Compaction; Computer science; Very long instruction word; Function (biology); Position (finance); Parallel computing; Process (computing); Algorithm; Programming language; Engineering","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.0001718207,0.00007876707,0.0001101825,0.00005028916,0.0001213605,0.00007978069,0.0005387357,0.0000262152,0.00001691977],"category_scores_gemma":[0.00001223241,0.00005327724,0.00004550885,0.000363969,0.0000654479,0.0001385606,0.0001525639,0.00006415442,0.00001004172],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002199211,"about_ca_system_score_gemma":0.000007306384,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001286682,"about_ca_topic_score_gemma":0.000005732799,"domain_scores_codex":[0.9992635,0.00005315005,0.000184675,0.0001779805,0.000165086,0.0001556668],"domain_scores_gemma":[0.9993353,0.00002396806,0.00008481486,0.0004096598,0.00009583991,0.00005043678],"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.00002020742,0.0009369499,0.002187884,0.00005264072,0.00008007682,0.000003398288,0.004536948,0.1510163,0.006313097,0.5787986,0.01399232,0.2420616],"study_design_scores_gemma":[0.00008178843,0.00008145907,0.00022448,0.000008671815,0.000001929119,0.000004862816,0.00001452271,0.9942804,0.00224017,0.002335185,0.0006460287,0.00008050317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003566316,0.00001948161,0.9900442,0.0009619793,0.00009106725,0.0002501362,2.865054e-7,0.0003180546,0.004748487],"genre_scores_gemma":[0.4846077,0.000001766131,0.5150688,0.0001783393,0.00001393877,0.000003427911,2.6036e-7,0.000002394758,0.0001234104],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8432642,"threshold_uncertainty_score":0.2172583,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1391513714951341,"score_gpt":0.3184585678293937,"score_spread":0.1793071963342597,"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."}}