{"id":"W2954158457","doi":"10.1016/j.dam.2019.06.007","title":"Spectral bounds for graph partitioning with prescribed partition sizes","year":2019,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"Agence Nationale de la Recherche","keywords":"Adjacency matrix; Graph partition; Eigenvalues and eigenvectors; Mathematics; Combinatorics; Graph energy; Strength of a graph; Graph; Adjacency list; Partition (number theory); Spectral graph theory; Undirected graph; Discrete mathematics; Line graph; Voltage graph","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.0001028456,0.0001770501,0.0002238546,0.00005306536,0.0000575895,0.00007727038,0.0001028953,0.00007039381,0.00006209573],"category_scores_gemma":[0.000004238141,0.000149365,0.00005967354,0.0001062345,0.00003199613,0.0001085382,0.00001052575,0.00008895612,0.00003873575],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002565211,"about_ca_system_score_gemma":0.000007783687,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.552911e-7,"about_ca_topic_score_gemma":0.000003320138,"domain_scores_codex":[0.9992131,0.000002726192,0.0002130775,0.0001518931,0.0001392933,0.0002799349],"domain_scores_gemma":[0.9995705,0.00005895987,0.00004627999,0.0002515837,0.00002223868,0.00005040414],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001016548,0.0001537424,0.000307584,0.002600735,0.0003371726,0.000003535935,0.004014218,0.008337423,0.2375376,0.7389786,0.006073839,0.001553922],"study_design_scores_gemma":[0.002092142,0.0004877635,0.0002879549,0.0004383348,0.0002535007,0.00001660748,0.001101873,0.08984023,0.4918954,0.4077807,0.004383611,0.001421912],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.177443,0.00006276128,0.7801807,0.00002472882,0.00007433659,0.001413574,0.00003444526,0.001251713,0.03951473],"genre_scores_gemma":[0.9050705,0.00001341554,0.09421213,0.00002016475,0.00005122283,0.0004229447,0.00005431064,0.00006177989,0.00009351305],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7276275,"threshold_uncertainty_score":0.6090929,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008739207267766799,"score_gpt":0.2069153569503388,"score_spread":0.198176149682572,"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."}}