{"id":"W2086552038","doi":"10.1016/j.dam.2006.06.009","title":"The strong metric dimension of graphs and digraphs","year":2006,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":174,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Combinatorics; Mathematics; Metric dimension; Vertex (graph theory); Distance; Discrete mathematics; Neighbourhood (mathematics); Graph; Bound graph; Shortest path problem; Graph power; Line graph; Pathwidth","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.002688369,0.001043551,0.001781874,0.003822867,0.002729332,0.006597327,0.002269059,0.001868829,0.00383732],"category_scores_gemma":[0.01250422,0.001123137,0.001010265,0.004286325,0.007526846,0.01547529,0.004803407,0.004554444,0.0002883083],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002529157,"about_ca_system_score_gemma":0.0008491396,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001105829,"about_ca_topic_score_gemma":0.000948118,"domain_scores_codex":[0.9977661,0.0009426908,0.0001201659,0.0004630861,0.0004741727,0.0002337584],"domain_scores_gemma":[0.9835538,0.0102299,0.001737914,0.001530671,0.0009656781,0.001982189],"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.00003323353,0.00001160346,0.0005587839,0.00004345442,0.00001385152,0.00001730361,0.0001317817,0.001516655,0.0001853589,0.9932892,0.001143931,0.003054937],"study_design_scores_gemma":[0.000007843109,0.000008650916,0.0003185622,0.00001092676,0.000008701788,0.00004133893,0.0000601194,0.006273679,0.00009623375,0.991767,0.001396667,0.00001029144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5898884,0.008626578,0.3274596,0.018396,0.0007406167,0.00007554643,0.002008218,0.0002513888,0.0525537],"genre_scores_gemma":[0.9619127,0.002737206,0.0281888,0.0007716777,0.001020544,0.0001189801,0.0004984978,0.00007533502,0.004676186],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006597327,"threshold_uncertainty_score":0.01835042,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008347250750734546,"score_gpt":0.2142126271217022,"score_spread":0.2058653763709677,"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."}}