{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009153412,0.0008308039,0.0007144571,0.001219108,0.0005228173,0.001157596,0.0008011505,0.0004882091,0.00318966],"category_scores_gemma":[0.01219689,0.000510757,0.0005631437,0.00120987,0.0008077733,0.002923778,0.00114683,0.0008775928,0.0004383204],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001078964,"about_ca_system_score_gemma":0.001031675,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001514271,"about_ca_topic_score_gemma":0.002372911,"domain_scores_codex":[0.9990337,0.0001892106,0.00007132094,0.000159085,0.0004302181,0.0001165698],"domain_scores_gemma":[0.9933119,0.00437675,0.0006023318,0.0009887916,0.0006343378,0.00008579476],"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.0005744352,0.0001450553,0.003776456,0.0003019114,0.00007393846,0.0002554376,0.0004151123,0.5320005,0.07696225,0.04893357,0.001803796,0.3347575],"study_design_scores_gemma":[0.00008598729,0.0002281976,0.002047874,0.00003495194,0.00009859489,0.0002040803,0.00006809139,0.8711232,0.0706648,0.04745628,0.007948498,0.00003940226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.110779,0.0005409202,0.8797483,0.0003686565,0.00004586203,0.00009180682,0.00008236804,0.002079464,0.006263533],"genre_scores_gemma":[0.6069344,0.0006458222,0.3874901,0.0001172549,0.00009629677,0.0001712751,0.000361763,0.001091751,0.003091329],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00318966,"threshold_uncertainty_score":0.01067042,"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."}}