{"id":"W2134606315","doi":"10.1109/cicc.1991.164058","title":"An efficient eigenvector-node interchange approach for finding netlist partitions","year":2002,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Netlist; Heuristics; Eigenvalues and eigenvectors; Computer science; Node (physics); Partition (number theory); Benchmark (surveying); Theoretical computer science; Heuristic; Algorithm; Mathematics; Mathematical optimization; Combinatorics; Artificial intelligence","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000538751,0.001352575,0.0008752987,0.002472284,0.001221142,0.0008752,0.001367346,0.000608804,0.008429486],"category_scores_gemma":[0.001849924,0.0006047889,0.0007441112,0.002648831,0.0005272859,0.001269529,0.0008629683,0.0007356629,0.002132413],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009393503,"about_ca_system_score_gemma":0.001438135,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005033562,"about_ca_topic_score_gemma":0.01132176,"domain_scores_codex":[0.9995845,0.0001087741,0.00002206634,0.00007526041,0.000154508,0.00005493361],"domain_scores_gemma":[0.9993951,0.0002580045,0.00005654012,0.000100855,0.0001588721,0.00003048331],"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.0001857602,0.0001640845,0.0009744358,0.0002895321,0.00007118828,0.0002310551,0.0002237367,0.2012151,0.02732944,0.02776994,0.00811218,0.7334334],"study_design_scores_gemma":[0.0001023194,0.0002157892,0.0007524345,0.00004301324,0.00005868397,0.0003286933,0.0001693274,0.9148409,0.02141694,0.03980378,0.02221437,0.00005382597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004730441,0.0001112187,0.991954,0.00002367164,0.00001314086,0.0001109032,0.00007223909,0.000882698,0.002101673],"genre_scores_gemma":[0.03147268,0.000112072,0.9652425,0.00002917706,0.00001039833,0.0002178664,0.000453257,0.0002484463,0.00221359],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008429486,"threshold_uncertainty_score":0.02819949,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0666571393386486,"score_gpt":0.2536353325695826,"score_spread":0.186978193230934,"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."}}