{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001540029,0.0009316311,0.001130906,0.001113531,0.00185448,0.002274459,0.001368319,0.001871741,0.004512107],"category_scores_gemma":[0.008709992,0.0009710052,0.0007141501,0.0007600097,0.002636175,0.00332627,0.00217059,0.001755219,0.0005256748],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001331629,"about_ca_system_score_gemma":0.000579644,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005365901,"about_ca_topic_score_gemma":0.000622261,"domain_scores_codex":[0.9985377,0.0005187436,0.00005711148,0.0003247125,0.0002528251,0.0003089335],"domain_scores_gemma":[0.9942775,0.003411184,0.0006612834,0.0006839292,0.0003224821,0.0006435821],"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.0008348976,0.0002088732,0.001839944,0.0002039494,0.00009212949,0.0008910412,0.0009270073,0.1442444,0.01848492,0.8130595,0.005246608,0.01396676],"study_design_scores_gemma":[0.00006816482,0.0001129655,0.0005581873,0.00003232387,0.00002324891,0.0004146364,0.0003624212,0.2205698,0.00697246,0.7687197,0.002128034,0.00003790587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7672588,0.0002204597,0.20669,0.001081586,0.00006195001,0.00008620476,0.0002976209,0.0003242279,0.02397917],"genre_scores_gemma":[0.9707543,0.00008480644,0.02558946,0.00009836715,0.00003900469,0.00007523601,0.0001810096,0.00009318234,0.003084696],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004512107,"threshold_uncertainty_score":0.01509446,"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."}}