{"id":"W1772204473","doi":"","title":"An Efficient On-Line Algorithm for Edge-Ranking of Trees","year":2008,"lang":"en","type":"article","venue":"Americanae (AECID Library)","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Ranking (information retrieval); Computer science; Combinatorics; Graph; Enhanced Data Rates for GSM Evolution; Algorithm; Learning to rank; Line (geometry); Path (computing); Time complexity; Mathematics; Artificial intelligence","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.001167258,0.002247361,0.002025916,0.002433632,0.001696124,0.002556029,0.003790636,0.002069031,0.02257452],"category_scores_gemma":[0.004347801,0.0008834999,0.001495935,0.003773057,0.0007665977,0.004618417,0.003122652,0.002218366,0.008358086],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002095275,"about_ca_system_score_gemma":0.002736074,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005431434,"about_ca_topic_score_gemma":0.01363042,"domain_scores_codex":[0.9979873,0.000469318,0.000115396,0.0004675732,0.0005594483,0.0004010092],"domain_scores_gemma":[0.9965525,0.001530881,0.000238513,0.0009976957,0.0004421942,0.0002382039],"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.0005298455,0.000813649,0.001438736,0.0003677873,0.00007998708,0.0001442809,0.0002657744,0.04915596,0.008474614,0.01894365,0.06253292,0.8572528],"study_design_scores_gemma":[0.0004650838,0.0003154998,0.001062081,0.00004648902,0.00007911021,0.0004261443,0.0004257186,0.8466528,0.00869191,0.118288,0.02347577,0.00007138245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02495056,0.0005138747,0.9439313,0.0007225568,0.000117383,0.0006530275,0.001571137,0.01527582,0.01226424],"genre_scores_gemma":[0.06928812,0.0001565708,0.9172244,0.0002393153,0.00005993566,0.0003222603,0.003860508,0.0008728296,0.007976064],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02257452,"threshold_uncertainty_score":0.07551926,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02087993031207536,"score_gpt":0.2415017985836291,"score_spread":0.2206218682715537,"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."}}