{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001068785,0.0001803753,0.0002998029,0.000249463,0.0001761507,0.00002180818,0.0007945119,0.00004243888,0.00002023271],"category_scores_gemma":[0.00001811209,0.000156586,0.0001301479,0.0008067219,0.0002055266,0.0003894093,0.00009959288,0.0000887164,0.0000119662],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007377927,"about_ca_system_score_gemma":0.00009719697,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005329339,"about_ca_topic_score_gemma":0.000001099102,"domain_scores_codex":[0.9985036,0.00005594994,0.0003338629,0.0004798703,0.0002967111,0.0003300363],"domain_scores_gemma":[0.9986975,0.0001659326,0.0001861816,0.0007225684,0.00005760957,0.0001701674],"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.00006928261,0.001998964,0.01123881,0.00003186327,0.0001419348,0.00008960952,0.002205134,0.05713276,0.003520865,0.09583695,0.02181672,0.8059171],"study_design_scores_gemma":[0.00119906,0.002532138,0.0130418,0.00005808196,0.00001502942,0.00001908856,0.000053522,0.9519327,0.02512554,0.003981966,0.001532682,0.0005083616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5003995,0.0002757496,0.49679,0.0008729611,0.0004325116,0.0002848523,0.0000214063,0.0004140562,0.0005090408],"genre_scores_gemma":[0.7162057,0.00002805442,0.282568,0.0009603439,0.00002829579,0.0000196792,0.00001263665,0.00002175866,0.0001555605],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8947999,"threshold_uncertainty_score":0.6385393,"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."}}