{"id":"W2573740254","doi":"","title":"Neighbourly regular strength of a graph.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008442545,0.0004858794,0.0007223877,0.001922378,0.001337899,0.002110695,0.001238484,0.001211847,0.01523697],"category_scores_gemma":[0.005539489,0.0005025151,0.0006707662,0.0009801222,0.002090144,0.003267789,0.002169964,0.001820083,0.002652142],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005590959,"about_ca_system_score_gemma":0.0003967204,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006046154,"about_ca_topic_score_gemma":0.000908943,"domain_scores_codex":[0.9990471,0.0002300324,0.00004715375,0.0002335631,0.0003078678,0.0001342095],"domain_scores_gemma":[0.9955186,0.001585689,0.0006351276,0.0006402567,0.0007126136,0.0009076179],"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.0001289545,0.00003955092,0.0009177076,0.0001315355,0.0000427587,0.0004181603,0.0002650032,0.00110526,0.008327832,0.9744055,0.003267141,0.01095069],"study_design_scores_gemma":[0.0000391454,0.00007559222,0.001274645,0.00004647492,0.00005605683,0.001163166,0.0003207353,0.00733689,0.00361685,0.9731585,0.01288108,0.00003080585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.555851,0.0008217816,0.1689296,0.002784008,0.0008858038,0.0001554764,0.001278247,0.0006301545,0.2686639],"genre_scores_gemma":[0.9317758,0.000500691,0.02813174,0.0005592185,0.0003539883,0.00009345014,0.0006124781,0.0002111999,0.03776137],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01523697,"threshold_uncertainty_score":0.05097276,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01249078012748165,"score_gpt":0.2589532010007833,"score_spread":0.2464624208733016,"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."}}