{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008637387,0.0000533784,0.00004845025,0.0001028692,0.00008787307,0.00008387669,0.00008488735,0.00002469148,0.00001009017],"category_scores_gemma":[0.000007978251,0.00003473516,0.000009918739,0.0001511512,0.0000381696,0.001943733,0.00003517844,0.00002686173,0.00007710772],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001108978,"about_ca_system_score_gemma":0.00001767015,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000103662,"about_ca_topic_score_gemma":0.000002768361,"domain_scores_codex":[0.9995899,0.00002031297,0.0001331257,0.00007477939,0.00009946284,0.00008246634],"domain_scores_gemma":[0.9996556,0.00006058232,0.00007480381,0.00007140196,0.0001033872,0.00003420074],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006933299,0.000005433898,0.0000761485,0.000007742848,0.00000337913,3.56956e-7,0.0003689828,0.00001838727,0.000009212534,0.02540204,0.0001868717,0.9739145],"study_design_scores_gemma":[0.005704199,0.001204716,0.04646429,0.0003340522,0.00001894934,0.0005175377,0.0005402028,0.4828061,0.001530095,0.4060274,0.0538603,0.0009921432],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01603038,0.000007243103,0.9790093,0.002090652,0.0001020672,0.00006836609,0.000002247771,0.0001803741,0.002509377],"genre_scores_gemma":[0.8855536,0.00001819177,0.1134843,0.0008533951,0.0000304176,0.00001215217,0.00001542108,0.00000203262,0.00003048121],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9729224,"threshold_uncertainty_score":0.1416459,"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."}}