{"id":"W2251394987","doi":"10.1016/j.ic.2016.01.005","title":"Topology recognition with advice","year":2016,"lang":"en","type":"article","venue":"Information and Computation","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Advice (programming); Topology (electrical circuits); Oracle; Computer science; Node (physics); Network topology; Computation; Upper and lower bounds; Graph; Logical topology; Theoretical computer science; Mathematics; Computer network; Combinatorics; Algorithm","routes":{"ca_aff":true,"ca_fund":true,"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.0006894942,0.0008764493,0.0009766147,0.001885258,0.0009888465,0.002622325,0.001569021,0.001515879,0.02542282],"category_scores_gemma":[0.007624865,0.0005019107,0.001098477,0.001313516,0.0009876057,0.003947529,0.0025362,0.001830253,0.0112877],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007806207,"about_ca_system_score_gemma":0.001004071,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002586024,"about_ca_topic_score_gemma":0.004383812,"domain_scores_codex":[0.9986011,0.0002023509,0.0001034636,0.0004110009,0.0005269785,0.0001551009],"domain_scores_gemma":[0.9968535,0.0007602614,0.000112186,0.001434349,0.00066608,0.0001735963],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0005005954,0.0001888522,0.002681957,0.0003427174,0.00006007359,0.0004796485,0.0004581205,0.02781973,0.01595507,0.1627736,0.05537479,0.7333649],"study_design_scores_gemma":[0.00006182738,0.00008265057,0.0009083898,0.0001039284,0.00007123002,0.0004745769,0.0002304657,0.3495667,0.03488508,0.5228091,0.09073944,0.00006655641],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03338823,0.0002676296,0.8833774,0.0009889926,0.0005119851,0.0002112657,0.001564418,0.02550367,0.05418631],"genre_scores_gemma":[0.4436649,0.0003004857,0.4990744,0.0004993514,0.0002416894,0.0001964182,0.004198097,0.002978023,0.04884661],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02542282,"threshold_uncertainty_score":0.08504778,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01577560285626095,"score_gpt":0.2353759725628819,"score_spread":0.2196003697066209,"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."}}