{"id":"W2099470159","doi":"10.1109/epep.1998.734060","title":"Efficient simulation of high-speed distributed interconnects using Krylov-subspace techniques","year":2002,"lang":"en","type":"article","venue":"","topic":"Model Reduction and Neural Networks","field":"Physics and Astronomy","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Krylov subspace; Computer science; Interconnection; Discretization; Model order reduction; Reduction (mathematics); Transmission (telecommunications); Dimension (graph theory); Electric power transmission; Signal integrity; Electronic engineering; Parallel computing; Computational science; Algorithm; Iterative method; Telecommunications; Mathematics; Engineering; Electrical 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":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00003505175,0.00009245514,0.0001300315,0.00004197804,0.00004504794,0.00001435433,0.00005473131,0.00003041379,0.001329501],"category_scores_gemma":[0.00000278023,0.00007950953,0.00006033212,0.0001519389,0.0000265429,0.00003706592,0.00002680467,0.0000729004,0.000008234319],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001624757,"about_ca_system_score_gemma":0.000003145517,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000960812,"about_ca_topic_score_gemma":6.175882e-7,"domain_scores_codex":[0.9994506,0.00002309145,0.0001709092,0.0001396517,0.00008981226,0.0001259067],"domain_scores_gemma":[0.9996424,0.00003356029,0.00008620883,0.0001329088,0.00006313727,0.00004173159],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001075553,0.0001710964,0.0005462612,0.000004744591,0.00002060049,2.441832e-7,0.0000800306,0.9737411,0.007439157,0.005587215,0.0003713835,0.0120274],"study_design_scores_gemma":[0.0001515976,0.00002324245,0.00007660559,0.00001812639,0.00001077653,2.901416e-7,0.00005122301,0.9675635,0.03163056,0.0001765151,0.0002084999,0.00008912245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6537111,0.000006779902,0.3445556,0.00005913727,0.00006908691,0.0001022012,0.000009121451,0.00004412494,0.001442772],"genre_scores_gemma":[0.998612,5.740304e-7,0.001022432,0.00001298738,0.0001205545,0.000001433412,0.0000155815,0.000008637476,0.0002057293],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3449009,"threshold_uncertainty_score":0.9995834,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03168718834238335,"score_gpt":0.2714316498431568,"score_spread":0.2397444615007734,"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."}}