{"id":"W1988115395","doi":"10.1007/s00453-012-9712-9","title":"Compact Navigation and Distance Oracles for Graphs with Small Treewidth","year":2012,"lang":"en","type":"article","venue":"Algorithmica","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Treewidth; Oracle; Combinatorics; Mathematics; Discrete mathematics; Bounded function; Adjacency list; Constant (computer programming); Computer science; Graph; Pathwidth; Line graph","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.0001763226,0.0001506657,0.0001580091,0.00004815562,0.0001972715,0.0001267481,0.0003275767,0.00004415715,0.000002046848],"category_scores_gemma":[0.000009077291,0.0001102639,0.00003163995,0.0001905408,0.00006413211,0.00083308,0.00008697539,0.00007981615,0.000004697477],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000189007,"about_ca_system_score_gemma":0.00002047516,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004377427,"about_ca_topic_score_gemma":0.000005239297,"domain_scores_codex":[0.9990517,0.00002738812,0.000141162,0.0002874569,0.0001538131,0.000338501],"domain_scores_gemma":[0.99918,0.00012717,0.00008964795,0.0003745415,0.00006230963,0.0001663904],"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.00007023597,0.0002852464,0.00670481,0.00007752318,0.00006237932,0.000007278549,0.001014637,0.00001986445,0.0006208306,0.1471016,0.003240866,0.8407947],"study_design_scores_gemma":[0.00612001,0.001601144,0.1182819,0.0006240682,0.0001461949,0.0004166477,0.0003335436,0.4703594,0.01697738,0.06345411,0.3191133,0.002572248],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02134156,0.0005219824,0.9770424,0.0003245452,0.000186489,0.0002535693,0.00004158577,0.0001193127,0.0001685504],"genre_scores_gemma":[0.5529376,0.00001786376,0.44659,0.0001168151,0.0001537801,0.00002484129,0.00006314452,0.00001587267,0.00008010049],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8382225,"threshold_uncertainty_score":0.4496433,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02106720772572859,"score_gpt":0.2459330226512327,"score_spread":0.2248658149255041,"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."}}