{"id":"W2952198500","doi":"10.48550/arxiv.1311.7064","title":"On the Relationships between Zero Forcing Numbers and Certain Graph Coverings","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Combinatorics; Graph; Discrete mathematics; Forcing (mathematics); Upper and lower bounds; Zero (linguistics); Cubic graph; Line graph; Voltage graph; Mathematical analysis","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001420639,0.0005570502,0.0006383501,0.002572488,0.001625058,0.002582897,0.0009278397,0.001057527,0.004877898],"category_scores_gemma":[0.01137324,0.0004776073,0.0005612016,0.001662765,0.005377468,0.005107535,0.002041397,0.001858751,0.0004969898],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001578048,"about_ca_system_score_gemma":0.0005280723,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007587763,"about_ca_topic_score_gemma":0.0007952565,"domain_scores_codex":[0.9990535,0.0002113631,0.00005331481,0.0002711412,0.0002241948,0.0001864405],"domain_scores_gemma":[0.9834976,0.01277911,0.001410044,0.0009755893,0.0005656599,0.000771897],"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.00007703172,0.00002273605,0.001997879,0.00006190717,0.000009079918,0.0001062776,0.0002502542,0.006162729,0.002629658,0.9792604,0.0009802389,0.008441808],"study_design_scores_gemma":[0.00001253783,0.00003012428,0.001101618,0.00002571275,0.00001103655,0.0002117981,0.00008712593,0.01582626,0.001425001,0.9794956,0.001751988,0.00002122163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.7934808,0.0008430008,0.1401008,0.001419259,0.00009958828,0.00004993931,0.000382466,0.0003019593,0.0633221],"genre_scores_gemma":[0.9771668,0.0004924529,0.01836918,0.000217801,0.0001532565,0.00005957899,0.0002754976,0.0001046184,0.003160612],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.004877898,"threshold_uncertainty_score":0.0163182,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1120578328340242,"score_gpt":0.2177312740719335,"score_spread":0.1056734412379092,"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."}}