{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003703843,0.0004161149,0.0005262558,0.0005794391,0.0003701797,0.0004844952,0.0005206113,0.0004887303,0.002541874],"category_scores_gemma":[0.002281274,0.0001831953,0.0003227342,0.0009854861,0.0003714423,0.000840921,0.0004931166,0.0004309653,0.0008403299],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007979004,"about_ca_system_score_gemma":0.002472942,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008338053,"about_ca_topic_score_gemma":0.01694682,"domain_scores_codex":[0.9997136,0.00005221597,0.00001764543,0.00005052208,0.0001145318,0.00005148209],"domain_scores_gemma":[0.9994236,0.0002939329,0.00004077445,0.00007230115,0.0001443131,0.0000251701],"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.0003327178,0.0001111337,0.001911015,0.0002829442,0.00005171903,0.0001524498,0.0001770758,0.5862045,0.02545949,0.02771739,0.006342523,0.3512571],"study_design_scores_gemma":[0.00003173044,0.00002538174,0.0001801338,0.000005601461,0.000006781467,0.0000316439,0.00002312372,0.9876755,0.005938187,0.004968616,0.00110773,0.000005583051],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09772272,0.000357226,0.890709,0.0002405127,0.00004113044,0.00007424294,0.0002033451,0.002725942,0.007925873],"genre_scores_gemma":[0.2860766,0.0002103568,0.7092639,0.00009375558,0.00001731744,0.0001087839,0.0004587015,0.0002874068,0.003483175],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008338053,"threshold_uncertainty_score":0.01657909,"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."}}