{"id":"W2977451371","doi":"","title":"Cache-Oblivious Priority Queues with Decrease-Key and Applications to Graph Algorithms","year":2019,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Key (lock); Queue; Priority queue; Graph; Algorithm; Theoretical computer science; Computer network; 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.0001199716,0.0001430726,0.0001713436,0.0001087689,0.00012942,0.00009905879,0.0005499186,0.00005648996,0.000007319788],"category_scores_gemma":[0.00000553126,0.000136925,0.00003748679,0.0009295406,0.00004871619,0.0004056489,0.0001639216,0.00009750724,0.0001118707],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004570957,"about_ca_system_score_gemma":0.00007039329,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003545071,"about_ca_topic_score_gemma":0.0001228124,"domain_scores_codex":[0.9989373,0.00003400704,0.00009649547,0.000608449,0.00007790741,0.000245808],"domain_scores_gemma":[0.9988431,0.0000420308,0.00006412988,0.0006330871,0.0001183299,0.0002993608],"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.00004965121,0.000192857,0.06204143,0.0000689411,0.00009310274,0.0001547602,0.0006168935,0.008627695,0.0002777905,0.9190835,0.0004647503,0.008328636],"study_design_scores_gemma":[0.008529936,0.001932397,0.1435327,0.000490539,0.0002328171,0.0003391985,0.001909771,0.6341229,0.001236107,0.04092168,0.1622866,0.004465352],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3936423,0.00004848214,0.6035488,0.0000712835,0.00004930468,0.0003907676,0.00001457998,0.0001323689,0.002102059],"genre_scores_gemma":[0.9968924,0.00001847521,0.00211787,0.0001218055,0.00002372344,0.000003143447,0.000004077177,0.000007031452,0.0008114888],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8781618,"threshold_uncertainty_score":0.5583642,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02259245584232719,"score_gpt":0.1740320194729433,"score_spread":0.1514395636306161,"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."}}