{"id":"W2807933378","doi":"10.1007/s00224-019-09955-7","title":"Advice Complexity of Priority Algorithms","year":2019,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"Concordia University; University of Toronto","funders":"","keywords":"Advice (programming); Oracle; Computer science; Reduction (mathematics); Mathematical proof; Function (biology); Algorithm; Matching (statistics); Adversary; Greedy algorithm; Upper and lower bounds; Theoretical computer science; Mathematics; Programming language; Computer security","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.005736406,0.001061981,0.002488524,0.001939797,0.002329604,0.008472776,0.004384428,0.003982607,0.02382311],"category_scores_gemma":[0.08011673,0.001110233,0.0016112,0.00279047,0.003750682,0.01547057,0.003548514,0.007113153,0.002017262],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005335697,"about_ca_system_score_gemma":0.005805817,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004591542,"about_ca_topic_score_gemma":0.004711099,"domain_scores_codex":[0.9910759,0.002921956,0.0003967563,0.001085122,0.003021377,0.001498948],"domain_scores_gemma":[0.913891,0.07249784,0.001983098,0.005207081,0.003872358,0.002548718],"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.001002845,0.0002855203,0.002141514,0.0003444479,0.00007844108,0.0001063096,0.0004882083,0.05905765,0.001408304,0.8804688,0.01392846,0.04068965],"study_design_scores_gemma":[0.0001296834,0.00004614661,0.0004627699,0.0000232543,0.0000414186,0.00005532087,0.00005903361,0.2149717,0.0004928312,0.7822586,0.001440774,0.00001843286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2553693,0.002478911,0.6223446,0.01812435,0.000736533,0.0002715047,0.001238781,0.001592311,0.09784368],"genre_scores_gemma":[0.8961949,0.001211094,0.07188331,0.001325687,0.001072766,0.0002942269,0.001065799,0.0006767888,0.02627543],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02382311,"threshold_uncertainty_score":0.07969624,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03455034673156813,"score_gpt":0.2786913157960295,"score_spread":0.2441409690644613,"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."}}