{"id":"W2948867122","doi":"10.1515/spma-2020-0106","title":"Maximum nullity and zero forcing of circulant graphs","year":2020,"lang":"en","type":"preprint","venue":"Special Matrices","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Redeemer University; McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Circulant matrix; Bipartite graph; Mathematics; Zero (linguistics); Combinatorics; Upper and lower bounds; Circulant graph; Graph; Forcing (mathematics); Rank (graph theory); Torus; Discrete mathematics; Line graph; Voltage graph; Mathematical analysis; Geometry","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.0002573781,0.0002083768,0.0004638361,0.0001220233,0.00009272663,0.00004771404,0.0003067049,0.0001812469,0.0001030491],"category_scores_gemma":[0.0001137966,0.0001990385,0.000181137,0.0002181966,0.0001123595,0.0000383712,0.0004025577,0.0003252301,0.000009737206],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001369096,"about_ca_system_score_gemma":0.00003825396,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003904702,"about_ca_topic_score_gemma":0.00001422904,"domain_scores_codex":[0.998791,0.00005733351,0.0004245372,0.0003682198,0.0001995473,0.000159352],"domain_scores_gemma":[0.9988027,0.0002449374,0.0004153016,0.0003950135,0.00005938809,0.00008264323],"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.00003008222,0.00005997235,0.0006285688,0.001037706,0.00007030003,0.000003700347,0.0006884085,0.000002848322,0.0003500533,0.9940238,0.001461925,0.001642645],"study_design_scores_gemma":[0.0001216435,0.00001547283,0.001527799,0.00009208096,0.0001448812,0.000003021074,0.0001221142,0.00002220159,0.0005659686,0.9957407,0.00146031,0.000183775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.970311,0.0006367697,0.004031934,0.0004913632,0.0004932096,0.000898472,0.0003102513,0.0001428611,0.02268414],"genre_scores_gemma":[0.992051,0.0002745732,0.006849383,0.00002523452,0.0006763067,0.00004229955,0.00002102062,0.00002658531,0.00003357298],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02265057,"threshold_uncertainty_score":0.8116556,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05579625248886667,"score_gpt":0.3084285747196465,"score_spread":0.2526323222307799,"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."}}