{"id":"W2533585991","doi":"10.1109/icm-02.2002.1161537","title":"A high-level data path allocation algorithm based on BIST testability metrics","year":2004,"lang":"en","type":"article","venue":"","topic":"VLSI and Analog Circuit Testing","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria; St. Francis Xavier University","funders":"","keywords":"Testability; Computer science; Metric (unit); Path (computing); Built-in self-test; Design for testing; High-level synthesis; Algorithm; Test data; Register allocation; Reliability engineering; Engineering; Embedded system; Field-programmable gate array","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.0007613117,0.0007936973,0.0005177716,0.001579998,0.0003238688,0.0007842336,0.001183327,0.0005032938,0.002079521],"category_scores_gemma":[0.002851912,0.0002407904,0.000263137,0.0006902813,0.0003565074,0.001164822,0.0007739058,0.0006998185,0.0005773112],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000945197,"about_ca_system_score_gemma":0.0007959074,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001301072,"about_ca_topic_score_gemma":0.001690326,"domain_scores_codex":[0.9993269,0.0001669741,0.00006036596,0.0001306091,0.0002597381,0.00005536677],"domain_scores_gemma":[0.9987522,0.0004719298,0.0001451533,0.0001639596,0.0004197167,0.0000469927],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001770244,0.0001270745,0.001695374,0.0001398224,0.00004342189,0.00004946489,0.00005194289,0.07249445,0.06411017,0.011695,0.002641557,0.8467748],"study_design_scores_gemma":[0.00006374902,0.0002976703,0.001189025,0.00001996411,0.00002641755,0.0001524627,0.00001918975,0.9165104,0.0691767,0.008147274,0.004363505,0.00003373345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00809784,0.00009046443,0.9888322,0.00005041096,0.0000138538,0.0000777817,0.00003152586,0.00206144,0.0007444702],"genre_scores_gemma":[0.1616477,0.00005349885,0.8368203,0.00008689512,0.00001789844,0.0001856083,0.0002482433,0.0001942489,0.0007456918],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002079521,"threshold_uncertainty_score":0.006956697,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08724448348443713,"score_gpt":0.2741399158972033,"score_spread":0.1868954324127661,"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."}}