{"id":"W7110023578","doi":"10.4230/lipics.icdt.2025.25","title":"Optimal Oblivious Algorithms for Multi-Way Joins","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Joins; Cloud computing; Matching (statistics); Upload; Logarithm; Cryptography; Join (topology); Computational complexity theory; Computation","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.003406968,0.0007216171,0.001160974,0.0008253508,0.001812708,0.003215671,0.002665252,0.001529888,0.003871721],"category_scores_gemma":[0.009886434,0.0007617497,0.001377987,0.001359812,0.003064391,0.007799535,0.005278201,0.003947729,0.001486841],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002107362,"about_ca_system_score_gemma":0.002686682,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005074072,"about_ca_topic_score_gemma":0.0007639563,"domain_scores_codex":[0.9948756,0.001127007,0.0003864154,0.0009063089,0.001999496,0.0007052124],"domain_scores_gemma":[0.9915062,0.00388748,0.0007047855,0.003259538,0.0003976746,0.000244338],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0022087,0.0005218714,0.001725988,0.0005184031,0.0001658109,0.0001746492,0.001012195,0.1984656,0.04203622,0.5726723,0.007350168,0.1731481],"study_design_scores_gemma":[0.0001953744,0.0001924474,0.0001934995,0.00003466848,0.00004982743,0.0001434756,0.00009726502,0.5066649,0.02916623,0.4585814,0.004635865,0.0000450499],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04416708,0.0002874861,0.9480973,0.000608205,0.00004832783,0.0001664227,0.0001228302,0.002104255,0.004397895],"genre_scores_gemma":[0.6068317,0.0003051699,0.3861155,0.0004184808,0.0001020524,0.0003991868,0.000393134,0.0005041908,0.004930618],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003871721,"threshold_uncertainty_score":0.01801801,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03058253492664396,"score_gpt":0.3035335577761135,"score_spread":0.2729510228494695,"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."}}