{"id":"W2022117185","doi":"10.1145/509907.509950","title":"Cache-oblivious priority queue and graph algorithm applications","year":2002,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":101,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Priority queue; Cache; Parallel computing; Cache-oblivious algorithm; Queue; Cache algorithms; Graph; Theoretical computer science; CPU cache; Algorithm; Computer network","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.001340986,0.0005223607,0.0004706862,0.0008742869,0.0008488884,0.001702154,0.002301976,0.0007470887,0.003263378],"category_scores_gemma":[0.007583458,0.0003763506,0.0003963909,0.001625862,0.001070174,0.004034786,0.00155075,0.001799952,0.0007396328],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001968244,"about_ca_system_score_gemma":0.002496029,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00371842,"about_ca_topic_score_gemma":0.004904149,"domain_scores_codex":[0.9986911,0.0002960937,0.00008899024,0.0001814904,0.0005492392,0.0001931384],"domain_scores_gemma":[0.996437,0.001556308,0.0002541505,0.0008306662,0.0007821394,0.0001397479],"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.0003829132,0.0002469574,0.001270012,0.0003290609,0.00005041349,0.0001471594,0.0003969725,0.1779525,0.01063302,0.5702517,0.01079989,0.2275394],"study_design_scores_gemma":[0.00006821497,0.0001426139,0.0001621284,0.00002908177,0.00003350121,0.0001402236,0.00005724272,0.7598951,0.01115669,0.2148451,0.01344739,0.00002275669],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02226317,0.000645413,0.9706302,0.0006724662,0.0001101187,0.00008486243,0.00008447219,0.0009701723,0.004539156],"genre_scores_gemma":[0.3101186,0.0009256782,0.6813584,0.0003888459,0.0001903608,0.000181505,0.0003471737,0.0002673468,0.006222126],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00371842,"threshold_uncertainty_score":0.01428074,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01298618704765494,"score_gpt":0.2229243720543181,"score_spread":0.2099381850066632,"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."}}