{"id":"W4234183293","doi":"10.1109/aspdac.2002.994967","title":"Probabilistic analysis of rectilinear Steiner trees","year":2003,"lang":"en","type":"article","venue":"Proceedings of ASP-DAC/VLSI Design 2002. 7th Asia and South Pacific Design Automation Conference and 15h International Conference on VLSI Design","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Windsor","funders":"","keywords":"Steiner tree problem; Probabilistic logic; Very-large-scale integration; Computer science; Set (abstract data type); Interconnection; Tree (set theory); Statistical model; Algorithm; Probabilistic analysis of algorithms; Theoretical computer science; Mathematical optimization; Mathematics; Artificial intelligence; Combinatorics; Programming language","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.001731782,0.000696813,0.001109922,0.001414784,0.0001576233,0.0003551492,0.0004855502,0.0004100992,0.0004762066],"category_scores_gemma":[0.0005770826,0.0006576059,0.0001927144,0.0009682962,0.0003386448,0.0006995864,0.00003890282,0.0003937766,0.00001602104],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009116909,"about_ca_system_score_gemma":0.00018834,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000880591,"about_ca_topic_score_gemma":0.000001308621,"domain_scores_codex":[0.9963441,0.000198316,0.001263071,0.0008135136,0.0008466674,0.0005343592],"domain_scores_gemma":[0.997016,0.0004899916,0.0006078149,0.0002729079,0.001340188,0.0002730854],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001820501,0.001434042,0.005332129,0.001690059,0.008139989,0.0000412091,0.02639748,0.03240433,0.4127443,0.4104273,0.009952428,0.0896163],"study_design_scores_gemma":[0.001331648,0.001247291,0.001595482,0.0005400614,0.0009347441,0.00002973923,0.003945131,0.8887385,0.09296087,0.007244798,0.0002700987,0.001161663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02450543,0.0002486225,0.9439369,0.0001209941,0.0002436054,0.001875012,0.0001012915,0.0006780458,0.02829009],"genre_scores_gemma":[0.9619921,0.000573004,0.03638342,0.00002322101,0.00003930613,0.0002060171,0.00002474609,0.00006235143,0.000695821],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9374867,"threshold_uncertainty_score":0.9995875,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05023175393092778,"score_gpt":0.2535599742568865,"score_spread":0.2033282203259588,"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."}}