{"id":"W2014206268","doi":"10.5555/365411.365524","title":"Worst case constant time priority queue","year":2001,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Priority queue; Constant (computer programming); Queue; Computer science; Discrete time and continuous time; Topology (electrical circuits); Upper and lower bounds; Data structure; Distributed computing; Mathematics; Computer network; Combinatorics","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":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000494457,0.00008562706,0.0001091549,0.00007712048,0.0001957536,0.0002054048,0.001254594,0.00004978429,0.0003042505],"category_scores_gemma":[0.00004232167,0.00007467117,0.00003529639,0.0006431031,0.00009040696,0.0003533351,0.0007765593,0.0002168419,0.0009116374],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006132249,"about_ca_system_score_gemma":0.0001062622,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001910991,"about_ca_topic_score_gemma":0.0001737816,"domain_scores_codex":[0.9988793,0.0001394822,0.0001767918,0.000244103,0.0002553501,0.0003049385],"domain_scores_gemma":[0.9980281,0.0002708464,0.00003581373,0.00138756,0.0001256484,0.0001520228],"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.00001428898,0.000277573,0.001584567,0.000007193709,0.00003102356,0.004958157,0.0005603003,0.0002648587,0.0005464808,0.734906,0.01843998,0.2384095],"study_design_scores_gemma":[0.000459447,0.00005336806,0.0003942241,0.00001780264,0.000002043754,0.0053566,0.00004475783,0.9236895,0.0003038711,0.004551281,0.06480861,0.0003184465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03055192,0.00024966,0.7994843,0.006685294,0.00009949401,0.0002865505,0.00000105394,0.0005561184,0.1620856],"genre_scores_gemma":[0.953474,0.00008943505,0.04031016,0.0002936383,0.00004099845,0.0000123817,0.000001299146,0.00000680219,0.005771262],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9234247,"threshold_uncertainty_score":0.9998662,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02755013712640158,"score_gpt":0.2961255509425371,"score_spread":0.2685754138161355,"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."}}