{"id":"W2171368936","doi":"10.1109/mwscas.2009.5235932","title":"Optimal trace compaction with property preservation","year":2009,"lang":"en","type":"article","venue":"","topic":"VLSI and Analog Circuit Testing","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"TRACE (psycholinguistics); Computer science; Debugging; Property (philosophy); Overhead (engineering); Task (project management); Compaction; Representation (politics); Binary number; Computer engineering; Algorithm; Theoretical computer science; Programming language; Arithmetic; Mathematics; Engineering","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":[],"consensus_categories":[],"category_scores_codex":[0.00008524588,0.00005591261,0.00005397186,0.00002796074,0.00008269587,0.0001118534,0.0001841756,0.00001645987,0.000007467593],"category_scores_gemma":[0.00001143118,0.00003041501,0.00001238109,0.0002069989,0.000007220573,0.00100676,0.00001012087,0.00005628218,0.00001425737],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001441227,"about_ca_system_score_gemma":0.00002470156,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000360489,"about_ca_topic_score_gemma":0.000005766457,"domain_scores_codex":[0.9994962,0.00001391365,0.00007285982,0.0001573911,0.0001358454,0.0001238134],"domain_scores_gemma":[0.9997003,0.00001277926,0.0000302067,0.0001651122,0.00005258826,0.0000390019],"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.000001996975,0.0001874874,0.00434486,0.00000811217,0.000008870486,0.00001665253,0.000715689,0.01411329,0.009246402,0.02461816,0.002119014,0.9446195],"study_design_scores_gemma":[0.0003542657,0.0004997451,0.08010832,0.00003006413,0.000003925085,0.00006694195,0.00003391168,0.9121512,0.003473712,0.0005481392,0.002516573,0.0002132191],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05583205,0.000009745086,0.9165139,0.002079452,0.00002109128,0.00007487229,5.67971e-8,0.000274486,0.02519436],"genre_scores_gemma":[0.9744697,5.553777e-7,0.02382069,0.0002887071,0.00003259893,0.000001327706,6.639106e-7,0.000001757368,0.001383974],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9444063,"threshold_uncertainty_score":0.1240288,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02978616108103084,"score_gpt":0.2359846100898073,"score_spread":0.2061984490087765,"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."}}