{"id":"W3138772443","doi":"10.4230/lipics.icdt.2021.3","title":"Box Covers and Domain Orderings for Beyond Worst-Case Join Processing","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Joins; Computer science; Join (topology); Generalization; Domain (mathematical analysis); Cover (algebra); Set (abstract data type); Algorithm; Approximation algorithm; Block (permutation group theory); Certificate; Theoretical computer science; Discrete mathematics; Mathematics; Combinatorics","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":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005860065,0.0003808364,0.0004511265,0.00022044,0.0008405982,0.001155647,0.0006591103,0.0001693481,0.00001341922],"category_scores_gemma":[0.0001192476,0.0003786111,0.0002244036,0.0005418748,0.0001783639,0.00210097,0.0006732738,0.0003067333,0.00001011134],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007590606,"about_ca_system_score_gemma":0.0001695423,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009564057,"about_ca_topic_score_gemma":0.00004138802,"domain_scores_codex":[0.997564,0.00002962668,0.0008377109,0.0004301686,0.0003634506,0.0007750647],"domain_scores_gemma":[0.9981765,0.0002176871,0.0003250991,0.0006384995,0.0003881816,0.0002539893],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0003976099,0.001524882,0.002737452,0.007276034,0.000757557,0.0009477828,0.08070659,0.0004011658,0.0007627053,0.3210604,0.02162912,0.5617988],"study_design_scores_gemma":[0.01172674,0.0007046546,0.0002319088,0.0006619865,0.0001144038,0.006815212,0.008261381,0.3955231,0.005047367,0.08762598,0.481028,0.002259284],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09501897,0.0002817376,0.8996075,0.0009624782,0.0007624887,0.0009597701,0.0003450968,0.0002350802,0.001826916],"genre_scores_gemma":[0.2546266,0.00007339012,0.7409763,0.003127765,0.000223656,0.0002479811,0.0002520646,0.00006242997,0.0004097386],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5595394,"threshold_uncertainty_score":0.9998813,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0151199343484145,"score_gpt":0.2510682944724922,"score_spread":0.2359483601240777,"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."}}