{"id":"W2944999878","doi":"10.7146/brics.v11i2.21827","title":"Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths","year":2004,"lang":"en","type":"article","venue":"BRICS Report Series","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University","funders":"Deutsche Forschungsgemeinschaft","keywords":"Computer science; Combinatorics; Data structure; Algorithm; Theoretical computer science; Mathematics","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.0005161203,0.0001471845,0.0001935864,0.0001027197,0.0003457452,0.0005069819,0.0004673469,0.00007347736,0.000003467715],"category_scores_gemma":[0.0002366147,0.0001338571,0.00001809166,0.0003293019,0.0001630467,0.0008613926,0.0006865498,0.0001101507,7.244622e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002816936,"about_ca_system_score_gemma":0.000225661,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003711842,"about_ca_topic_score_gemma":0.0004399262,"domain_scores_codex":[0.9984514,0.00002509261,0.0002823146,0.0006217288,0.0003163225,0.0003032132],"domain_scores_gemma":[0.9986654,0.00007599103,0.00007487665,0.0007885834,0.0002279608,0.0001672064],"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":[0.0002311909,0.00123787,0.1256266,0.001839326,0.0009455397,0.007807418,0.03124575,0.03589704,0.002325874,0.3286922,0.01245689,0.4516943],"study_design_scores_gemma":[0.005879823,0.001944083,0.3068171,0.0003029736,0.0001461209,0.03460127,0.001263893,0.4288435,0.004919858,0.07519338,0.1365788,0.003509276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04224288,0.0008835564,0.9505098,0.004074891,0.0003577931,0.0009334203,0.0001197212,0.0003861292,0.0004918353],"genre_scores_gemma":[0.483314,0.001049673,0.513637,0.0002196402,0.0001290827,0.00004799982,0.0004357102,0.00004214853,0.001124763],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4481851,"threshold_uncertainty_score":0.5458533,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07440722122927845,"score_gpt":0.3161123087104155,"score_spread":0.2417050874811371,"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."}}