{"id":"W2167881201","doi":"10.1109/ccece.2008.4564673","title":"An effective congestion-based integer programming model for VLSI global routing","year":2008,"lang":"en","type":"article","venue":"Conference proceedings - Canadian Conference on Electrical and Computer Engineering","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Integer programming; Computer science; Very-large-scale integration; Routing (electronic design automation); Router; Parallel computing; Steiner tree problem; Mathematical optimization; Algorithm; Computer network; Mathematics; Embedded system","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":true,"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.0001332537,0.000425357,0.0003824344,0.0002604824,0.0002057933,0.0002499085,0.0002970019,0.0002400331,0.000004876959],"category_scores_gemma":[0.00004039868,0.0004481878,0.00007019105,0.0003413866,0.00006002485,0.0002776967,0.00001443094,0.000388805,0.00000252124],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003437731,"about_ca_system_score_gemma":0.0002501926,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000394924,"about_ca_topic_score_gemma":0.0002550624,"domain_scores_codex":[0.9982219,0.000006693775,0.0002769284,0.0005009402,0.0001686469,0.0008249386],"domain_scores_gemma":[0.9988043,0.00005696486,0.00003951355,0.0001195089,0.0003231832,0.0006565352],"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.0001034592,0.000169809,0.008232769,0.0005797764,0.0002031028,0.00006189105,0.001981111,0.1279116,0.004910947,0.2040998,0.001029763,0.650716],"study_design_scores_gemma":[0.0003344261,0.000436455,0.001580823,0.0001422756,0.00001788587,0.00003215742,0.000009820602,0.9954714,0.0007648836,0.0005183145,0.0001424816,0.0005490508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08565686,0.00005567936,0.9120183,0.00007791239,0.00009730036,0.0007822089,0.00002352093,0.0009278842,0.0003603317],"genre_scores_gemma":[0.9819068,0.00002145252,0.01737684,0.000134715,0.0001340306,0.0003538621,0.00001756254,0.00004623429,0.000008543023],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8962499,"threshold_uncertainty_score":0.999797,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01575072268814795,"score_gpt":0.212242527783285,"score_spread":0.1964918050951371,"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."}}