{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001767694,0.001537374,0.001328478,0.002455743,0.001573093,0.002531303,0.004815597,0.001528462,0.008883283],"category_scores_gemma":[0.009330384,0.001023823,0.001519602,0.005905655,0.001674228,0.008901916,0.003865683,0.003663701,0.00348104],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003156041,"about_ca_system_score_gemma":0.004903646,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00604635,"about_ca_topic_score_gemma":0.00792418,"domain_scores_codex":[0.9967906,0.0005127493,0.0003389603,0.0006754614,0.001251238,0.0004309148],"domain_scores_gemma":[0.9931114,0.001890052,0.0005555378,0.003070696,0.001191753,0.0001806105],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009574224,0.0004778558,0.001937757,0.001190945,0.0002233769,0.000154146,0.0007408225,0.1626842,0.01592791,0.2499149,0.0414631,0.5243275],"study_design_scores_gemma":[0.0003275164,0.0003133347,0.0004387932,0.0001688459,0.0001292509,0.00023771,0.0001993596,0.5895755,0.02274154,0.3469763,0.03876438,0.0001274617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01440079,0.001228353,0.9704945,0.0006554595,0.0001364442,0.0001847959,0.001032744,0.006501222,0.005365586],"genre_scores_gemma":[0.1347246,0.0007986458,0.8523794,0.0004499176,0.000154371,0.0007574197,0.003329877,0.001288346,0.006117458],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008883283,"threshold_uncertainty_score":0.0297175,"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."}}