{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001367119,0.0006849878,0.0009061823,0.002465716,0.001385726,0.002529331,0.001814045,0.001234125,0.003813556],"category_scores_gemma":[0.009137222,0.0006884253,0.001147342,0.001833462,0.003361268,0.005451156,0.002854428,0.002452998,0.0008105418],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001495702,"about_ca_system_score_gemma":0.000777818,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001220198,"about_ca_topic_score_gemma":0.001376856,"domain_scores_codex":[0.9978795,0.0006271554,0.0001381546,0.0007341853,0.0004222658,0.0001987713],"domain_scores_gemma":[0.9931648,0.003569329,0.0006399673,0.001688865,0.0006198501,0.0003172715],"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.000193954,0.00007045105,0.002320017,0.0001875125,0.00005204309,0.0003039107,0.000467274,0.112102,0.007632311,0.8162037,0.001642334,0.05882465],"study_design_scores_gemma":[0.00002376147,0.00004588432,0.0005545227,0.000035671,0.00002990363,0.0002916659,0.0002283864,0.2473058,0.005117814,0.7397023,0.006627161,0.00003711586],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0781604,0.0002333588,0.9146781,0.0003380644,0.00007773112,0.00007707151,0.0001547945,0.0004009527,0.005879485],"genre_scores_gemma":[0.5786459,0.0004704647,0.4097177,0.0002954762,0.0001127805,0.0002308867,0.0004524048,0.00027958,0.009794714],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003813556,"threshold_uncertainty_score":0.01275766,"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."}}