{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001808088,0.0008544824,0.001161414,0.001647861,0.001260699,0.002746477,0.002414631,0.001831508,0.003440907],"category_scores_gemma":[0.0254049,0.001032768,0.0007808901,0.001210209,0.002339322,0.00451453,0.002226153,0.001376631,0.0005908486],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001733327,"about_ca_system_score_gemma":0.001457391,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001045079,"about_ca_topic_score_gemma":0.001313572,"domain_scores_codex":[0.9977609,0.0006549121,0.0001778928,0.0005424659,0.0003959614,0.0004678728],"domain_scores_gemma":[0.952144,0.03478056,0.005470378,0.003229404,0.001517993,0.002857685],"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.006453714,0.0005049614,0.02918022,0.001350369,0.0002385364,0.001140735,0.003769158,0.2755892,0.05915986,0.5250778,0.01313895,0.08439646],"study_design_scores_gemma":[0.0003247991,0.0005986486,0.00859785,0.0001788377,0.0001935536,0.001806514,0.001185682,0.3821037,0.0349579,0.565309,0.004598272,0.0001453627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9567502,0.0002999095,0.0329339,0.0008973318,0.00003298619,0.00007627359,0.001199991,0.0003916219,0.00741767],"genre_scores_gemma":[0.9725562,0.0003753521,0.02282007,0.0001394143,0.00006984166,0.0001803548,0.001376868,0.0002914188,0.002190544],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003440907,"threshold_uncertainty_score":0.01257628,"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."}}