{"id":"W2772134378","doi":"10.1088/1367-2630/aaccae","title":"Efficient code for relativistic quantum summoning","year":2018,"lang":"en","type":"article","venue":"New Journal of Physics","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"Canadian Institute for Advanced Research; University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Division of Physics; Alberta Innovates - Technology Futures; Gordon and Betty Moore Foundation","keywords":"Quantum; Encoding (memory); Code (set theory); Protocol (science); Scaling; Decoding methods; Point (geometry); Task (project management); Quantum information","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002605135,0.00007589927,0.000130995,0.000074599,0.00011614,0.00009031201,0.000409236,0.000023548,0.000004632234],"category_scores_gemma":[0.00004992247,0.00006206558,0.0001358701,0.0002975251,0.00004350612,0.0002576698,0.00003491039,0.0001075011,0.00002494997],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000186116,"about_ca_system_score_gemma":0.0001233231,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.313971e-7,"about_ca_topic_score_gemma":5.003662e-7,"domain_scores_codex":[0.9991964,0.00001693076,0.0003088123,0.00006967275,0.0002526113,0.0001555558],"domain_scores_gemma":[0.998942,0.0001007831,0.0003678709,0.0001591727,0.0003239675,0.0001061839],"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.00002496487,0.00005340156,0.00008163834,0.00001070306,0.00002785711,0.000001384266,0.001949507,0.002580777,0.0003924939,0.9514847,0.008996313,0.03439622],"study_design_scores_gemma":[0.001155292,0.0007978766,0.0006220546,0.00009262745,0.00002231124,0.00003108686,0.00008522539,0.7730589,0.005852505,0.198085,0.02001773,0.0001793782],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02582022,0.00003565248,0.9721175,0.0003057161,0.00063971,0.00005188492,0.000001556046,0.00001996987,0.001007797],"genre_scores_gemma":[0.9477863,0.000002251286,0.05134001,0.0002386084,0.0005851437,5.702582e-7,3.236786e-7,0.000005459902,0.00004127622],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9219661,"threshold_uncertainty_score":0.2530961,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02789839868827266,"score_gpt":0.2777115641431721,"score_spread":0.2498131654548995,"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."}}