{"id":"W2996622318","doi":"10.1515/spma-2019-0022","title":"Achievable multiplicity partitions in the inverse eigenvalue problem of a graph","year":2019,"lang":"en","type":"article","venue":"Special Matrices","topic":"Graph theory and applications","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"Brandon University; University of Regina","funders":"Palestine Polytechnic University; Canada Research Chairs; Deutscher Akademischer Austauschdienst; Natural Sciences and Engineering Research Council of Canada; European Commission; Universität Konstanz; Bundesministerium für Bildung und Forschung; University of Regina","keywords":"Mathematics; Combinatorics; Multiplicity (mathematics); Indifference graph; Partition (number theory); Diagonal; Discrete mathematics; Eigenvalues and eigenvectors; Chordal graph; Cograph; Graph; 1-planar graph","routes":{"ca_aff":true,"ca_fund":true,"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.000464231,0.00008385425,0.0001492149,0.0001104543,0.00007928083,0.00001793037,0.0002746095,0.00004835324,0.0004478822],"category_scores_gemma":[0.0000348949,0.00006037796,0.0000857008,0.0006437395,0.00006272116,0.00009440087,0.00003294289,0.0001198799,0.0001326993],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009214777,"about_ca_system_score_gemma":0.00001810559,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007638744,"about_ca_topic_score_gemma":0.0005680763,"domain_scores_codex":[0.9992144,0.00009551667,0.0002514781,0.0001360445,0.0001532201,0.000149393],"domain_scores_gemma":[0.9991589,0.0003554732,0.0001316068,0.0003007003,0.00003162986,0.00002172118],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001862115,0.0003099205,0.008258304,0.00009426742,0.00001190737,6.516266e-7,0.001937676,0.00004760926,0.0008947967,0.9853526,0.002883703,0.000189884],"study_design_scores_gemma":[0.000289633,0.00003474454,0.004650445,0.00002465375,0.00002640615,0.000001617975,0.001171582,0.00002821726,0.0006211217,0.9853199,0.007741964,0.00008973286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9491748,0.0000214491,0.00005287594,0.0001969549,0.00004549669,0.0006592448,0.00002659025,0.00002367846,0.04979892],"genre_scores_gemma":[0.9954011,0.00002390849,0.003891482,0.00005060062,0.0001932719,0.00009454892,0.000004555437,0.000008982764,0.0003315816],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04946734,"threshold_uncertainty_score":0.4903996,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02902387294734162,"score_gpt":0.288474923220522,"score_spread":0.2594510502731804,"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."}}