{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008083281,0.0001085247,0.0001003605,0.00008184212,0.00007334541,0.00004256077,0.0001171971,0.00006222222,0.0002806906],"category_scores_gemma":[0.000005679328,0.0001017199,0.0000536798,0.00009921183,0.00001654312,0.00006667103,0.000009224437,0.0000698619,0.00002261936],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004475613,"about_ca_system_score_gemma":0.0000010411,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007993912,"about_ca_topic_score_gemma":0.000004722923,"domain_scores_codex":[0.9994337,0.000009617508,0.0001232048,0.0001386755,0.00006107008,0.0002337392],"domain_scores_gemma":[0.9996929,0.0000195025,0.000009261136,0.0001906278,0.0000161125,0.00007161687],"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.00002089766,0.001662858,0.001069286,0.0009525995,0.0002597099,0.00001338616,0.009684101,0.4107467,0.1400654,0.03851144,0.3194888,0.07752481],"study_design_scores_gemma":[0.0001032671,0.00005368357,0.00006701131,0.000008096725,0.000009729276,0.000003177134,0.00008265282,0.9837398,0.01293645,0.00008680503,0.002737289,0.0001720235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01199953,0.0001429181,0.9629823,0.0000173747,0.000082556,0.0003156982,0.00002410457,0.001280286,0.02315525],"genre_scores_gemma":[0.943924,0.00001627137,0.05538355,0.00005097694,0.0001021095,0.0002264038,0.00003335514,0.00003175072,0.0002315699],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9319245,"threshold_uncertainty_score":0.4148018,"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."}}