{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009211616,0.0004052992,0.0004770895,0.001807898,0.001017854,0.001230824,0.0006775254,0.0005388527,0.003105605],"category_scores_gemma":[0.006574475,0.0002306696,0.0003454361,0.0005879432,0.002583036,0.001529346,0.0009897923,0.0007326336,0.0002958995],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006238227,"about_ca_system_score_gemma":0.0005024368,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004676435,"about_ca_topic_score_gemma":0.0007226446,"domain_scores_codex":[0.9992224,0.0002075632,0.00003544184,0.0001412381,0.0002303213,0.0001629645],"domain_scores_gemma":[0.9919444,0.004382538,0.001180197,0.0007517113,0.0008238134,0.0009172239],"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.0002011088,0.00006204609,0.003651957,0.00009833484,0.00001937828,0.000215708,0.0003184647,0.02518719,0.0329675,0.9249694,0.001349104,0.01095976],"study_design_scores_gemma":[0.00002729829,0.000152299,0.002891449,0.00005375528,0.00001414437,0.0003723525,0.000252936,0.1341235,0.0193028,0.8401876,0.00257035,0.00005138515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8061809,0.0001976295,0.1783555,0.0003172121,0.00006229385,0.00002677447,0.0002099692,0.0001655432,0.01448422],"genre_scores_gemma":[0.9855183,0.00009068599,0.01271155,0.00003575688,0.00004346011,0.00002578386,0.00009605262,0.00003640555,0.001441846],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003105605,"threshold_uncertainty_score":0.01038933,"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."}}