{"id":"W2953293297","doi":"10.48550/arxiv.1312.4973","title":"The metric dimension of small distance-regular and strongly regular\\n graphs","year":2013,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Metric dimension; Combinatorics; Mathematics; Valency; Strongly regular graph; Chordal graph; Vertex (graph theory); Discrete mathematics; Distance; Indifference graph; Random regular graph; Odd graph; Graph; Pathwidth; 1-planar graph; Line graph; Shortest path problem","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001403547,0.0008420058,0.000943398,0.0008341122,0.001132391,0.0003937689,0.002747706,0.0005624497,0.00001651814],"category_scores_gemma":[0.0001295767,0.0007235411,0.0005681979,0.00312175,0.001660602,0.0004922093,0.003595084,0.0009565766,0.0000396457],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001232105,"about_ca_system_score_gemma":0.000260516,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006372323,"about_ca_topic_score_gemma":0.00007895893,"domain_scores_codex":[0.9946932,0.0006534618,0.0008947199,0.002387891,0.0003771966,0.0009934891],"domain_scores_gemma":[0.9931645,0.0006604115,0.001300569,0.003311053,0.001012912,0.0005504905],"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.00009148756,0.0001894194,0.003760287,0.0001721501,0.0003122976,0.00006117232,0.0002242597,0.06561539,0.0003842291,0.9255562,0.0001608628,0.003472272],"study_design_scores_gemma":[0.00128375,0.0003165953,0.002575517,0.0004218613,0.0003512434,0.0000113271,0.0003369473,0.4914019,0.0006901961,0.5011356,0.0006386022,0.0008365167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8776071,0.004883349,0.1145002,0.0002439373,0.001263613,0.0009423227,0.00001890923,0.0001364897,0.0004040567],"genre_scores_gemma":[0.9903327,0.004758539,0.002721998,0.00003519946,0.00001380194,0.000002770089,0.000009421684,0.00004119161,0.002084355],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4257865,"threshold_uncertainty_score":0.9995216,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03989409703358735,"score_gpt":0.1661506013601386,"score_spread":0.1262565043265513,"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."}}