{"id":"W2949080538","doi":"10.48550/arxiv.0910.5952","title":"Streaming universal distortion-free entanglement concentration","year":2009,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Quantum entanglement; Qubit; Block (permutation group theory); Randomness; Mathematics; Binary logarithm; Discrete mathematics; Upper and lower bounds; Combinatorics; Quantum; Physics; Quantum mechanics; Statistics; Mathematical analysis","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.0001952224,0.0003070435,0.0002607974,0.00007708737,0.0002144051,0.0001730027,0.001588751,0.0001554346,0.0000144923],"category_scores_gemma":[0.00003465723,0.0003045466,0.0001513106,0.0001702883,0.00004694915,0.0001514757,0.001386964,0.0005657605,0.00002507273],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002316139,"about_ca_system_score_gemma":0.000179563,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009931832,"about_ca_topic_score_gemma":0.0000203124,"domain_scores_codex":[0.9980301,0.0001002448,0.0003420457,0.0007607968,0.0003845686,0.0003822468],"domain_scores_gemma":[0.9982353,0.00005294711,0.0002806537,0.001218143,0.00008323436,0.0001297624],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004124843,0.001078955,0.2059583,0.0003283856,0.0004590407,0.0007184977,0.01122058,0.1085298,0.002063474,0.0341377,0.009573894,0.6258901],"study_design_scores_gemma":[0.001570469,0.0004092696,0.3470146,0.0007051986,0.00009076382,0.00003253271,0.0001195991,0.6186963,0.003344231,0.01735522,0.008973734,0.001688018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6849684,0.0002397242,0.3106288,0.00165854,0.001356987,0.0002313066,0.0000134868,0.0003326533,0.0005700769],"genre_scores_gemma":[0.9796814,0.00003888125,0.01931028,0.0002838622,0.0004784499,0.000005931416,0.00006141028,0.00001427238,0.0001255343],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6242021,"threshold_uncertainty_score":0.9999407,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01718490996426221,"score_gpt":0.2371341474520845,"score_spread":0.2199492374878223,"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."}}