{"id":"W2287320187","doi":"10.1007/978-3-642-45278-9_34","title":"Circuit Complexity of Shuffle","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; String (physics); Circuit complexity; Reduction (mathematics); Computational complexity theory; Combinatorics; Discrete mathematics; Upper and lower bounds; Parity (physics); Theoretical computer science; Mathematics; Algorithm; Electronic circuit; Physics; Quantum mechanics","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.0003943885,0.0004636289,0.0006615284,0.0008809499,0.0009465705,0.00307827,0.001147991,0.001020162,0.020957],"category_scores_gemma":[0.002803155,0.0004131274,0.0006568441,0.001639398,0.001345744,0.00484667,0.001315667,0.002753699,0.002411024],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00215289,"about_ca_system_score_gemma":0.001213806,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008791685,"about_ca_topic_score_gemma":0.001010628,"domain_scores_codex":[0.9992946,0.0001098293,0.00002704722,0.0001102615,0.0003319407,0.0001263386],"domain_scores_gemma":[0.998441,0.0009576183,0.00007960856,0.0002850193,0.000146348,0.00009026219],"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.00006085624,0.00003132455,0.0001648545,0.00009464943,0.00001068808,0.00003309574,0.00006829824,0.006093357,0.0008791986,0.9618491,0.007427502,0.02328705],"study_design_scores_gemma":[0.00001115244,0.00001073678,0.0001538085,0.00001327081,0.000007045457,0.00005067817,0.00001559973,0.00640015,0.0007203239,0.9868147,0.00579459,0.000007958616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.214133,0.005643185,0.1615821,0.007230124,0.0006865836,0.0001353386,0.001933652,0.0005966888,0.6080594],"genre_scores_gemma":[0.8938116,0.003708562,0.01915055,0.0007482807,0.0007177913,0.0001995563,0.001168953,0.0003175975,0.08017704],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.020957,"threshold_uncertainty_score":0.07010812,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04321056273481346,"score_gpt":0.2538070008524498,"score_spread":0.2105964381176364,"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."}}