{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002604057,0.001016867,0.001429592,0.001441674,0.001062297,0.002909326,0.001513785,0.001196248,0.004446439],"category_scores_gemma":[0.01066417,0.0009325112,0.00172099,0.002571217,0.00209234,0.007717614,0.002741685,0.003316477,0.001262934],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001941492,"about_ca_system_score_gemma":0.002551707,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00203193,"about_ca_topic_score_gemma":0.003220491,"domain_scores_codex":[0.9961678,0.000686747,0.0002725997,0.0007865405,0.001640544,0.0004455925],"domain_scores_gemma":[0.9896899,0.005930324,0.0006473757,0.002778454,0.0006708193,0.0002830984],"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.001075913,0.0004280358,0.003018925,0.0004742667,0.0001191879,0.0002969397,0.0006394488,0.3326778,0.03034721,0.3508852,0.01525226,0.2647848],"study_design_scores_gemma":[0.00008995059,0.0001616642,0.0004549291,0.0000419558,0.00003784106,0.0002285844,0.0001213693,0.7431127,0.01388839,0.2316945,0.01013276,0.00003545176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03553338,0.0004880415,0.9565228,0.0005456712,0.00004757858,0.0001144908,0.0003395804,0.00257719,0.003831299],"genre_scores_gemma":[0.2653891,0.000470909,0.728539,0.0003086892,0.0001842791,0.0002515996,0.001585295,0.0008030924,0.002467822],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004446439,"threshold_uncertainty_score":0.01487488,"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."}}