{"id":"W2011704806","doi":"10.1109/tpds.2013.311","title":"Optimizing the Parallel Tree-Search for Finding Shortest-Span Error-Correcting CDO Codes","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Speedup; Notation; Algorithm; Function (biology); Tree (set theory); Theoretical computer science; Mathematics; Combinatorics; Parallel computing; Arithmetic","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.001386842,0.0003588277,0.0004408687,0.0001814119,0.001266293,0.0005426016,0.0008515411,0.0001814416,0.000002417787],"category_scores_gemma":[0.00004636856,0.0002809617,0.0001959679,0.0004898427,0.0001036718,0.0003625696,0.00001364953,0.0004836089,0.00000994701],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001143848,"about_ca_system_score_gemma":0.00006095083,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003503178,"about_ca_topic_score_gemma":0.0001840892,"domain_scores_codex":[0.9973569,0.0003309101,0.0005450537,0.0007164927,0.0003904524,0.0006601913],"domain_scores_gemma":[0.9972814,0.0014211,0.0001810244,0.000759211,0.0001733556,0.0001838776],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008883973,0.0001608888,0.0003420548,0.00009767343,0.0001081373,0.000004893949,0.001947113,0.9631449,0.0007029594,0.002908443,0.0008204392,0.02967366],"study_design_scores_gemma":[0.0006041534,0.0003143455,0.0001405957,0.000177485,0.00004321924,0.0001119239,0.0009477352,0.9949459,0.001208124,0.0001911871,0.0008968189,0.0004184646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007410736,0.0001542935,0.9886294,0.0005381978,0.001141129,0.0009438246,0.00005384556,0.000813587,0.0003149981],"genre_scores_gemma":[0.9776894,0.00002345788,0.02134023,0.00007467417,0.0001020948,0.0004780951,0.00001546789,0.00003296082,0.0002435899],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9702787,"threshold_uncertainty_score":0.9999642,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04601219332185101,"score_gpt":0.2909916860146083,"score_spread":0.2449794926927573,"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."}}