{"id":"W3009023057","doi":"10.1145/3512751","title":"Quantum Distributed Complexity of Set Disjointness on a Line","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Upper and lower bounds; Combinatorics; Mathematics; Bounded function; Vertex (graph theory); Path (computing); Constant (computer programming); Qubit; Binary logarithm; Discrete mathematics; Omega; Quantum; Computer science; Graph; Physics","routes":{"ca_aff":true,"ca_fund":true,"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.002520777,0.0007974142,0.001839678,0.0008886322,0.001675158,0.00458972,0.003503763,0.002402034,0.007189573],"category_scores_gemma":[0.02074955,0.0007307826,0.001382997,0.001544482,0.004357108,0.008736427,0.005309968,0.004810353,0.0007313134],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004060805,"about_ca_system_score_gemma":0.00180834,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001895959,"about_ca_topic_score_gemma":0.001248094,"domain_scores_codex":[0.9949592,0.001482198,0.0002609562,0.001285758,0.00102418,0.0009876885],"domain_scores_gemma":[0.9603258,0.03075992,0.002289313,0.004214813,0.001257827,0.001152329],"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.001453903,0.0002778032,0.002909538,0.0003834145,0.0002021661,0.0004910458,0.0009443297,0.4113255,0.01186405,0.5397927,0.004806081,0.02554953],"study_design_scores_gemma":[0.00008567081,0.00005366749,0.0002512749,0.00001539319,0.00002146774,0.00007439894,0.00005002489,0.7041339,0.002363815,0.2922738,0.0006515114,0.00002494865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5222707,0.0005004366,0.4549414,0.003902191,0.0000867617,0.0002120542,0.001090556,0.001209327,0.01578643],"genre_scores_gemma":[0.9485793,0.000193312,0.04613492,0.000393339,0.00009116239,0.0002660916,0.0006282548,0.0001773816,0.003536176],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007189573,"threshold_uncertainty_score":0.02946335,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04058135794070367,"score_gpt":0.2855338444806818,"score_spread":0.2449524865399781,"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."}}