{"id":"W4296192831","doi":"","title":"Minimum Sizes of Identifying Codes in Graphs Differing by One Edge or One Vertex","year":2012,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Vertex (graph theory); Combinatorics; Enhanced Data Rates for GSM Evolution; Mathematics; Graph; Computer science; Artificial intelligence","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.005505765,0.0003711083,0.0006375086,0.0004881618,0.0002278972,0.0004038849,0.003104106,0.0002806677,0.00008010098],"category_scores_gemma":[0.0006632698,0.0003983437,0.0002751427,0.0009702892,0.0002948965,0.0003806208,0.00304417,0.0006693611,0.00001208528],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007374011,"about_ca_system_score_gemma":0.000139531,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004643248,"about_ca_topic_score_gemma":0.0007508728,"domain_scores_codex":[0.9937761,0.00355117,0.0007702893,0.0008428716,0.0005353961,0.0005241954],"domain_scores_gemma":[0.9937951,0.002133623,0.0006176477,0.002579821,0.0006814828,0.0001923035],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001220325,0.005123873,0.01566094,0.001711338,0.0004369114,0.000009780984,0.04550318,0.00003205727,0.100272,0.6507714,0.0007244721,0.179632],"study_design_scores_gemma":[0.003247733,0.000005524872,0.04444435,0.01944763,0.0002425356,0.00001891735,0.00055364,0.02299267,0.6784379,0.2251053,0.002610429,0.002893315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5064595,0.004133837,0.47957,0.001586293,0.0005159472,0.0005276427,0.0000532806,0.0003220951,0.006831418],"genre_scores_gemma":[0.9588122,0.0008736606,0.03943518,0.00004062578,0.00001137936,0.00006382667,0.00007856429,0.00003224005,0.0006523543],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.578166,"threshold_uncertainty_score":0.9998468,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02920106580086076,"score_gpt":0.2430428087161937,"score_spread":0.213841742915333,"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."}}