{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005545484,0.0004628366,0.0006479445,0.0005976952,0.0001886547,0.0003328544,0.004828305,0.0002802838,0.0001644267],"category_scores_gemma":[0.00004921447,0.0003974176,0.0001410936,0.0004767329,0.00136621,0.0008841511,0.002699306,0.0006476292,0.0001280318],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001495562,"about_ca_system_score_gemma":0.0004228689,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001139911,"about_ca_topic_score_gemma":0.00002472375,"domain_scores_codex":[0.99631,0.00003040018,0.0006194549,0.001349935,0.001120406,0.0005697887],"domain_scores_gemma":[0.9966892,0.0002707651,0.0004179782,0.002099502,0.0003306163,0.0001919504],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002029321,0.00004506411,0.00002764653,0.00005474465,0.000009787162,0.00002814829,0.0003374326,0.002212932,0.0003091537,0.1924426,0.000170675,0.8043598],"study_design_scores_gemma":[0.0002123905,0.0001419075,0.000332033,0.0003744142,0.000004941562,0.00004074269,7.786865e-8,0.4235423,0.001623784,0.5705121,0.002664945,0.000550342],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00005134715,0.0003955314,0.9875371,0.0002730752,0.001331571,0.0003356584,0.00001721838,0.0001145782,0.009943955],"genre_scores_gemma":[0.1080954,0.00006138303,0.8896368,0.0009061982,0.0004997308,0.00001065561,0.00001963055,0.0000433392,0.000726884],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8038094,"threshold_uncertainty_score":0.9998478,"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."}}