{"id":"W1591325212","doi":"10.1109/epep.2005.1563763","title":"An efficient algorithm for generation of loop-tree basis in 2.5D interconnect models","year":2006,"lang":"en","type":"article","venue":"","topic":"Electromagnetic Scattering and Analysis","field":"Physics and Astronomy","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Manitoba; University of Winnipeg","funders":"","keywords":"Loop (graph theory); Interconnection; Tree (set theory); Basis (linear algebra); Algorithm; Computer science; Path (computing); Process (computing); Set (abstract data type); Moment (physics); Parallel computing; Mathematics; Combinatorics; Physics","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.0000942863,0.00007510491,0.0001323189,0.00008289556,0.00002323005,0.00001881863,0.00006998744,0.00001655866,0.00008180935],"category_scores_gemma":[4.67656e-7,0.00006747101,0.00007826016,0.000111523,0.00001068807,0.00004332986,0.000007690907,0.00002694604,0.000001354539],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001056981,"about_ca_system_score_gemma":0.00001173848,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001775211,"about_ca_topic_score_gemma":0.000133857,"domain_scores_codex":[0.9994337,0.00001801942,0.0001916911,0.000161673,0.00006069875,0.0001342357],"domain_scores_gemma":[0.9997489,0.00001905929,0.00004159595,0.0001313958,0.00003988954,0.00001908952],"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.000006516151,0.0008376073,0.003465523,0.000008765904,0.00005017185,2.76457e-7,0.0001468916,0.2175793,0.08569156,0.01501235,0.0003321957,0.6768688],"study_design_scores_gemma":[0.0002903277,0.00008413845,0.0002406504,0.000004923135,0.00001872065,6.766556e-8,0.00007580029,0.9182199,0.07937401,0.001608804,0.000006713793,0.00007593115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5210964,0.0000117667,0.4778245,0.00003369358,0.00001134843,0.00005073806,0.000007925611,0.0000059462,0.0009576799],"genre_scores_gemma":[0.9798193,3.157236e-7,0.01955315,0.00001132737,0.0001445651,0.0000267484,0.00007970383,0.000007505862,0.0003573873],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7006406,"threshold_uncertainty_score":0.2751388,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01585130415786652,"score_gpt":0.2384523576076466,"score_spread":0.2226010534497801,"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."}}