{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002551519,0.0002987387,0.0002688145,0.001253771,0.0004653232,0.00105607,0.0004304246,0.0002399944,0.002167157],"category_scores_gemma":[0.002452372,0.0001932058,0.0002374244,0.0008827005,0.001509544,0.001341962,0.0007962745,0.0006125126,0.0002181771],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007522706,"about_ca_system_score_gemma":0.0003184237,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001246289,"about_ca_topic_score_gemma":0.001419446,"domain_scores_codex":[0.9996637,0.00008456981,0.00001708592,0.00008035211,0.00009571205,0.00005860454],"domain_scores_gemma":[0.9984931,0.0007706066,0.0002441932,0.0002194156,0.0001119108,0.0001607243],"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.0004505224,0.0001024162,0.01030381,0.0002794035,0.00007554619,0.0001679193,0.0006926564,0.05837782,0.009290905,0.8604048,0.01175528,0.04809891],"study_design_scores_gemma":[0.00004962402,0.00006908074,0.01027928,0.00002684818,0.00002801122,0.000308402,0.0003243764,0.1134632,0.006059322,0.8577576,0.0115805,0.00005374218],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9487526,0.000622027,0.02294986,0.0004997799,0.00004351732,0.00001571325,0.001206101,0.0002290904,0.02568127],"genre_scores_gemma":[0.986803,0.0003407403,0.01036185,0.00006580436,0.00003848722,0.00002113164,0.0006506182,0.00004729555,0.001670988],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002167157,"threshold_uncertainty_score":0.007249892,"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."}}