{"id":"W4299924846","doi":"","title":"Reducing Subject Tree Browsing Complexity","year":2013,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Centre for Interdisciplinary Research in Music Media and Technology; McGill University","funders":"","keywords":"Subject (documents); Tree (set theory); Computer science; World Wide Web; Mathematics; Combinatorics","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":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.004021048,0.0004120659,0.0004427575,0.0002289054,0.0006485692,0.001808539,0.004226464,0.0002607801,0.00008682697],"category_scores_gemma":[0.0007225639,0.0004484266,0.000221197,0.0006033043,0.0003049161,0.000480369,0.004499495,0.0008445291,0.0001851305],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001526311,"about_ca_system_score_gemma":0.0003665312,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00462341,"about_ca_topic_score_gemma":0.0006490971,"domain_scores_codex":[0.9944485,0.002523287,0.0006437562,0.00135949,0.0005097697,0.0005152323],"domain_scores_gemma":[0.9918063,0.001011093,0.0006104553,0.004759356,0.001546898,0.0002659012],"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.000001428576,0.0004737344,0.0001994687,0.0001173386,0.00007031403,0.000004231143,0.007431624,0.00006676681,0.001820429,0.426924,0.006975826,0.5559148],"study_design_scores_gemma":[0.000596507,7.02655e-7,0.00783867,0.002617499,0.00005408145,0.00004323039,0.0001090064,0.8689582,0.03047598,0.05948889,0.02846226,0.001355024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02772328,0.0004924401,0.905986,0.01294384,0.0003439964,0.0005079918,0.00007635333,0.0007073936,0.05121872],"genre_scores_gemma":[0.2170779,0.0001819826,0.7767637,0.000139855,0.00005835757,0.0001657205,0.0005381827,0.00004817129,0.0050262],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8688914,"threshold_uncertainty_score":0.9997967,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03447510554845135,"score_gpt":0.2524591331642551,"score_spread":0.2179840276158038,"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."}}