{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007329973,0.0004859013,0.0005495822,0.0005783085,0.0006594249,0.0008324027,0.002134311,0.0002922307,0.00001227308],"category_scores_gemma":[0.000151477,0.0004536727,0.0005432369,0.0008098006,0.0001586255,0.002334554,0.0008420758,0.0004006374,0.00005267714],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009939408,"about_ca_system_score_gemma":0.0001519699,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002300167,"about_ca_topic_score_gemma":0.0000304582,"domain_scores_codex":[0.9968889,0.00003306675,0.00115694,0.0004921961,0.0003966488,0.001032235],"domain_scores_gemma":[0.9974416,0.0002445489,0.0003426744,0.00132134,0.0004068957,0.0002429149],"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.000396568,0.002983416,0.004261013,0.00268478,0.001046041,0.00001651515,0.02599262,0.0005607536,0.0001780899,0.7266181,0.0858798,0.1493824],"study_design_scores_gemma":[0.007540151,0.0004326249,0.001522909,0.0002122942,0.00008011321,0.00003451334,0.0009754676,0.6760442,0.001510289,0.00454291,0.306157,0.0009475718],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0145365,0.0001087199,0.9776391,0.0004031538,0.001838069,0.001818133,0.001793287,0.0004211248,0.001441901],"genre_scores_gemma":[0.08863503,0.00007390134,0.9068447,0.002407855,0.0001759709,0.0005663233,0.00100061,0.00004094451,0.0002546626],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7220751,"threshold_uncertainty_score":0.9997915,"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."}}