{"id":"W2951012470","doi":"10.48550/arxiv.1304.6100","title":"Fault-Tolerant Renormalization Group Decoder for Abelian Topological Codes","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Intelligence Advanced Research Projects Activity; Compute Canada","keywords":"Abelian group; Generalization; Decoding methods; Fault tolerance; Computer science; Logarithm; Code (set theory); Mathematics; Algorithm; Topology (electrical circuits); Discrete mathematics; Combinatorics; Set (abstract data type)","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001596128,0.0002541663,0.0002745057,0.0001447929,0.0002653294,0.0002029437,0.001537522,0.0003065739,0.00004584877],"category_scores_gemma":[0.00001794175,0.0002639812,0.000196582,0.0003355805,0.00009719545,0.0003252148,0.001019757,0.0002339023,0.0001160666],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009889837,"about_ca_system_score_gemma":0.00006945723,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001627757,"about_ca_topic_score_gemma":0.0000544187,"domain_scores_codex":[0.9983644,0.00006863317,0.0002204858,0.0009450105,0.00007212538,0.0003293567],"domain_scores_gemma":[0.9983434,0.0001006059,0.0002028567,0.001043816,0.00016438,0.0001449306],"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.000007730401,0.0001431647,0.0003383395,0.00006463067,0.00004696087,0.00001760314,0.0001476139,0.03926678,0.0002162469,0.9569648,0.001161156,0.001624968],"study_design_scores_gemma":[0.0003256551,0.00003840896,0.0007822279,0.00002794572,0.00004092931,0.0000035686,0.00002802185,0.889782,0.000179711,0.1014239,0.007015834,0.0003518056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09156964,0.0000614238,0.9057828,0.0002417129,0.0002585856,0.0006467079,0.00003147035,0.0003568252,0.001050897],"genre_scores_gemma":[0.9829926,0.0001112513,0.01510434,0.0001618492,0.00006803738,0.00001860244,0.0001690196,0.00001515741,0.001359121],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.891423,"threshold_uncertainty_score":0.9999812,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06997492243038628,"score_gpt":0.202539798894542,"score_spread":0.1325648764641557,"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."}}