{"id":"W88251305","doi":"10.5555/2095116.2095168","title":"A little advice can be very helpful","year":2012,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"York University; University of Toronto","funders":"","keywords":"Logarithm; Advice (programming); Communication complexity; Multiplicative function; Conjecture; Computer science; Set (abstract data type); Protocol (science); Mathematics; Time complexity; Theoretical computer science; Upper and lower bounds; Discrete mathematics","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.0005303709,0.0004266248,0.0003624419,0.0002563548,0.0003900577,0.0002734965,0.001562578,0.000149403,0.00008279161],"category_scores_gemma":[0.000037385,0.0003906954,0.0002623932,0.0008518828,0.0001577785,0.0009593375,0.0005974031,0.0004144939,0.0002503814],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001183935,"about_ca_system_score_gemma":0.00008793204,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002044893,"about_ca_topic_score_gemma":0.00001825738,"domain_scores_codex":[0.9968318,0.0001641957,0.0003977771,0.0007038805,0.0007616631,0.001140653],"domain_scores_gemma":[0.9976383,0.000207429,0.000141946,0.001377346,0.000100801,0.0005341126],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001521521,0.00277626,0.003595464,0.0002765134,0.0006695748,0.0002393854,0.02127177,0.0005557976,0.008277929,0.7264768,0.05632147,0.1793869],"study_design_scores_gemma":[0.00461535,0.002395656,0.01245041,0.0004347542,0.000179438,0.0005350432,0.001053341,0.1872497,0.04250026,0.0253617,0.7176598,0.005564542],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05171162,0.005557974,0.5167189,0.09880995,0.03187602,0.003415453,0.0008182649,0.008331177,0.2827607],"genre_scores_gemma":[0.8300374,0.0003675179,0.1486918,0.01006593,0.003534111,0.0002569991,0.0001179107,0.0001551076,0.006773205],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7783258,"threshold_uncertainty_score":0.9998545,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02044801421950783,"score_gpt":0.2604827027832461,"score_spread":0.2400346885637383,"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."}}