{"id":"W1999343232","doi":"10.1145/1027084.1027090","title":"Segmented channel routability via satisfiability","year":2004,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo; Université de Montréal","funders":"","keywords":"Routing (electronic design automation); Computer science; Channel (broadcasting); Field-programmable gate array; Satisfiability; Constraint (computer-aided design); Boolean satisfiability problem; Algorithm; Electronic design automation; Network routing; Parallel computing; Embedded system; Mathematics; Computer network","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.0006498416,0.0002389872,0.0003317601,0.0002167646,0.00009306594,0.00002579676,0.0002687917,0.000181074,0.00005059176],"category_scores_gemma":[0.00002881829,0.0002470028,0.0001198871,0.0004198378,0.00004659118,0.0002435748,0.000002013697,0.0002530813,0.00003863248],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007958916,"about_ca_system_score_gemma":0.00008749927,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009702417,"about_ca_topic_score_gemma":0.00001297205,"domain_scores_codex":[0.9983281,0.000148489,0.0005841529,0.0002586852,0.0002929879,0.0003875695],"domain_scores_gemma":[0.9988801,0.0001583639,0.00009378704,0.0007019475,0.00009648148,0.00006929478],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00003119417,0.0002125,0.000008937011,0.0002529624,0.0001480727,7.250075e-7,0.0003841136,0.945714,0.03979697,0.0004859198,0.00004876007,0.01291588],"study_design_scores_gemma":[0.00160816,0.001188622,0.0006379412,0.000258016,0.0001123168,0.00005820886,0.0001501727,0.4745181,0.5000036,0.02064072,0.0001190252,0.0007051353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01569395,0.0002503175,0.9810951,0.00005167388,0.0002172491,0.001061983,0.0000144915,0.001472182,0.0001429853],"genre_scores_gemma":[0.9943501,0.0000516703,0.005185965,0.000008805564,0.00002148364,0.0003110746,0.000008050873,0.00003834022,0.00002454386],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9786561,"threshold_uncertainty_score":0.9999982,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01372837880318961,"score_gpt":0.2208525644390823,"score_spread":0.2071241856358927,"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."}}