{"id":"W4389224840","doi":"10.1145/3633512","title":"Parallel Acyclic Joins: Optimal Algorithms and Cyclicity Separation","year":2023,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Joins; Join (topology); Tuple; Class (philosophy); Upper and lower bounds; Combinatorics; Mathematics; Algorithm; Argument (complex analysis); Discrete mathematics; Computer science; Artificial intelligence","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.0006076624,0.00008860016,0.0001553196,0.0001209946,0.0002133473,0.000156276,0.002195273,0.000039406,0.000004785471],"category_scores_gemma":[0.0003472419,0.00005800855,0.0001319083,0.0005316533,0.00006350977,0.0004969601,0.001248844,0.000213014,0.00001628436],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001967089,"about_ca_system_score_gemma":0.00004006743,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006035976,"about_ca_topic_score_gemma":0.000003411916,"domain_scores_codex":[0.9989905,0.00008697704,0.0002810155,0.0001256982,0.0003405406,0.00017524],"domain_scores_gemma":[0.9987347,0.0001493332,0.0002415037,0.0007294459,0.00007230767,0.00007272897],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000210797,0.0009176495,0.02081683,0.0001449425,0.0009055784,0.0005653196,0.01573213,0.04246071,0.01592802,0.09320372,0.3921889,0.4169254],"study_design_scores_gemma":[0.001470051,0.0003600288,0.2298755,0.0001251979,0.00004384361,0.001049054,0.0001702709,0.3592163,0.002102474,0.3858986,0.01930556,0.0003831765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8307535,0.0003777029,0.1384495,0.0278304,0.001987528,0.0001595207,0.000003275526,0.0001004044,0.0003382125],"genre_scores_gemma":[0.5590063,0.0005526377,0.4373388,0.00128534,0.0009299064,0.000005388766,7.60711e-7,0.00001840604,0.0008624298],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4165422,"threshold_uncertainty_score":0.4079399,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04162814898446222,"score_gpt":0.3084241444342037,"score_spread":0.2667959954497415,"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."}}