{"id":"W1500986313","doi":"10.46298/dmtcs.574","title":"Adaptive Identification of Sets of Vertices in Graphs","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Identification (biology); Hamming distance; Combinatorics; Computer science; Discrete mathematics; Mathematics; Metric dimension; Chordal graph; Graph; 1-planar graph","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":["sts"],"consensus_categories":[],"category_scores_codex":[0.003723863,0.000165978,0.0003317974,0.0005011636,0.00009678776,0.00007063099,0.002417755,0.00004857248,0.0000123864],"category_scores_gemma":[0.0002952613,0.0001348082,0.00009104625,0.002226143,0.00311786,0.001277978,0.0009071457,0.0001681315,0.00001241705],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003154659,"about_ca_system_score_gemma":0.00006527284,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001906315,"about_ca_topic_score_gemma":4.025485e-7,"domain_scores_codex":[0.997104,0.0001602081,0.0007155275,0.000392037,0.001029318,0.0005988806],"domain_scores_gemma":[0.9976052,0.0006348006,0.0002907774,0.001004003,0.0002714918,0.0001937216],"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.000008616272,0.0001882658,0.0004465762,0.00005553935,0.000005547181,8.633513e-7,0.003562892,0.00009449223,0.00601591,0.9866496,0.000001140384,0.002970587],"study_design_scores_gemma":[0.0001216522,0.00007854776,0.001883718,0.00006792058,0.000004206766,0.000005357201,0.0001131257,0.352016,0.03178897,0.6138028,6.218706e-7,0.0001171213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1831991,0.00006421571,0.8153595,0.0000626065,0.0001381903,0.0002258413,0.000003598372,0.00002979265,0.0009172063],"genre_scores_gemma":[0.7749598,0.000004939288,0.2249968,0.00001290794,0.000007833052,0.00000899163,3.957575e-7,0.000006687266,0.000001578517],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5917608,"threshold_uncertainty_score":0.9995951,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02540146945130962,"score_gpt":0.3152598071798804,"score_spread":0.2898583377285708,"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."}}