{"id":"W1574759554","doi":"10.1007/3-540-40996-3_3","title":"Strategies for Hotlink Assignments","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec en Outaouais; Carleton University","funders":"","keywords":"Computer science; Directed acyclic graph; Zipf's law; Web page; Constant (computer programming); Combinatorics; Set (abstract data type); Binary tree; Discrete mathematics; Theoretical computer science; Algorithm; Mathematics; World Wide Web; Programming language; Statistics","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.001709701,0.001202988,0.001073922,0.002486518,0.004740287,0.006237034,0.003251482,0.002794745,0.06786206],"category_scores_gemma":[0.01140593,0.001197715,0.001151193,0.002840532,0.001980625,0.01304254,0.006868688,0.003355102,0.0140904],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001106052,"about_ca_system_score_gemma":0.001019635,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007144306,"about_ca_topic_score_gemma":0.001396244,"domain_scores_codex":[0.9978294,0.0006767621,0.0001179245,0.0004389808,0.0004427538,0.0004942541],"domain_scores_gemma":[0.9935673,0.002899337,0.0002552102,0.001649205,0.0008978515,0.0007311451],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00013764,0.00012613,0.0002968497,0.0001427522,0.00001955898,0.0001313104,0.000938607,0.001370784,0.001519971,0.9086432,0.01457894,0.07209439],"study_design_scores_gemma":[0.00002277471,0.00002748118,0.000103522,0.00003792805,0.00002722861,0.0001092474,0.0005380654,0.0087282,0.00189438,0.9664416,0.02204964,0.0000199034],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06326354,0.0004401308,0.5565493,0.00199885,0.0005858667,0.0004349073,0.0005505131,0.002665603,0.3735113],"genre_scores_gemma":[0.5212088,0.0006323281,0.194192,0.001003664,0.0003659551,0.000686789,0.001224905,0.002694024,0.2779915],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.06786206,"threshold_uncertainty_score":0.2270212,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02947728663966838,"score_gpt":0.3013976377944786,"score_spread":0.2719203511548102,"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."}}