{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002302911,0.0001127437,0.0003766119,0.0001125741,0.00005453436,0.00004075341,0.0009085027,0.00005220427,0.00001780329],"category_scores_gemma":[0.00004085451,0.0001033934,0.00007372545,0.0004022493,0.0001421931,0.000167002,0.0002922716,0.0001168188,0.0000421572],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002322042,"about_ca_system_score_gemma":0.00007415112,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006497009,"about_ca_topic_score_gemma":4.347257e-7,"domain_scores_codex":[0.998111,0.000510878,0.0005070234,0.000253315,0.0003940445,0.0002237019],"domain_scores_gemma":[0.9982938,0.000339065,0.0003764712,0.0006281641,0.0002967201,0.00006579585],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009554566,0.00007817486,0.0009975769,0.0003665525,0.00003094942,6.899934e-7,0.002180717,0.01864993,0.0007092363,0.9728321,0.00006452369,0.004079934],"study_design_scores_gemma":[0.0005038247,0.0001413052,0.002235095,0.0002246123,0.000003649735,0.0000106059,0.0002002432,0.9859535,0.0006670543,0.009595702,0.0003124017,0.0001519665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08752072,0.0001758583,0.8968521,0.00006118057,0.0008470871,0.0004512251,0.000003967401,0.000206676,0.01388116],"genre_scores_gemma":[0.9617743,0.000002579098,0.03776181,0.00002588722,0.0000368178,8.879128e-7,0.000001831487,0.000007520315,0.0003882916],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9673036,"threshold_uncertainty_score":0.4216262,"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."}}