{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001010094,0.0001047673,0.0001027895,0.00007121294,0.0002011922,0.0001640517,0.0004764911,0.00005145857,0.00005987194],"category_scores_gemma":[0.000004710996,0.00008518699,0.00002735517,0.0003088235,0.00004543341,0.0004802193,0.0003589209,0.0001035799,0.00008441601],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001099356,"about_ca_system_score_gemma":0.000008097446,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001363162,"about_ca_topic_score_gemma":0.000009714193,"domain_scores_codex":[0.9991077,0.00002459282,0.0001348269,0.0003723713,0.0001699467,0.0001906091],"domain_scores_gemma":[0.9991578,0.00004385181,0.00003824085,0.0005844077,0.00004487885,0.0001308146],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[1.534844e-7,0.00008445813,0.0001489896,0.000004107675,0.000005088746,0.00000402496,0.000125083,0.000001775315,0.00005164068,0.02600531,0.005318687,0.9682507],"study_design_scores_gemma":[0.0005078424,0.00008074192,0.004054802,0.00001219975,0.000009441635,0.0001050272,0.00003161208,0.7788239,0.0004177915,0.01820521,0.1972885,0.0004629245],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002644538,0.0007257582,0.9934719,0.0005251134,0.00007568721,0.000180569,0.000008137242,0.0002376068,0.004510793],"genre_scores_gemma":[0.04783614,0.0005547662,0.9485596,0.0006342067,0.0001653732,0.00009509718,0.000009610067,0.00001194329,0.002133243],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9677877,"threshold_uncertainty_score":0.3473825,"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."}}