{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004065869,0.000145959,0.0002004624,0.000146301,0.0002293745,0.00009992599,0.0003833493,0.0000476237,7.318373e-7],"category_scores_gemma":[0.00001820578,0.00009072653,0.00006469782,0.0006811886,0.0001628526,0.00007724256,0.0001975061,0.00008535998,0.000004098014],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004385972,"about_ca_system_score_gemma":0.00001181664,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000188791,"about_ca_topic_score_gemma":0.000004086372,"domain_scores_codex":[0.9988104,0.0000131402,0.0003789237,0.0002308565,0.0003290013,0.0002377329],"domain_scores_gemma":[0.9988213,0.0002925954,0.0002101083,0.0005715071,0.00005430104,0.00005023105],"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.000001579415,0.00003525169,0.00006343639,0.00003226613,0.00001227161,4.649173e-7,0.0001389879,0.00006636246,0.004935469,0.9928786,0.0002095798,0.001625742],"study_design_scores_gemma":[0.0002842816,0.00003318073,0.0002894914,0.00002532455,0.00002354155,0.000004639927,0.0001796919,0.01681616,0.007935799,0.9741502,0.0001068233,0.000150814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6925774,0.003601594,0.2745395,0.0005425427,0.0002767977,0.0009538907,0.000008588398,0.0004828445,0.0270168],"genre_scores_gemma":[0.9306274,0.00005750842,0.06922115,0.00001886789,0.000002201849,0.00001522582,0.000002079149,0.00001031646,0.00004526764],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2380499,"threshold_uncertainty_score":0.3699721,"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."}}