{"id":"W4250302035","doi":"10.1109/icpp.2004.1327909","title":"Non-uniform dependences partitioned by recurrence chains","year":2004,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Monotonic function; Lexicographical order; Loop (graph theory); Set (abstract data type); Computer science; Dataflow; Parallelism (grammar); Parallel computing; Algorithm; Mathematics; Topology (electrical circuits); Combinatorics; Mathematical analysis","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.0001771339,0.00009636441,0.0000897669,0.00005820128,0.0001613851,0.0001335176,0.0006652382,0.00004599669,0.00001412603],"category_scores_gemma":[0.0000161375,0.00008376548,0.00003282293,0.0003169165,0.00003230521,0.0004298245,0.000117204,0.0000795278,0.00007452],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000328376,"about_ca_system_score_gemma":0.00006452647,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006934799,"about_ca_topic_score_gemma":0.00001235048,"domain_scores_codex":[0.9991528,0.00001200436,0.000162908,0.0002687855,0.0001952489,0.0002082663],"domain_scores_gemma":[0.9994788,0.00001796201,0.0000593226,0.0002998738,0.00006585391,0.00007814576],"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.00001000969,0.0006153653,0.001106077,0.00004216712,0.00003580597,0.00002782481,0.002404838,0.08693866,0.001076987,0.7894049,0.0722569,0.04608049],"study_design_scores_gemma":[0.001126293,0.0004760617,0.0004712885,0.0001557687,0.000005742566,0.00004867273,0.00006748618,0.7869703,0.1182267,0.08294598,0.00849232,0.001013377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001316648,0.00004888902,0.9842229,0.001498,0.0001182632,0.00009109724,9.486996e-7,0.0006516197,0.01205164],"genre_scores_gemma":[0.6177574,0.00008397968,0.3809896,0.0005268949,0.00001986249,0.00001329624,0.000004415946,0.000003378365,0.0006011556],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7064589,"threshold_uncertainty_score":0.3415857,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01456108932161168,"score_gpt":0.2561223052985181,"score_spread":0.2415612159769064,"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."}}