{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001000631,0.0005599332,0.0005260134,0.0009750895,0.0003689647,0.0009631975,0.005161475,0.0003250576,0.0000481337],"category_scores_gemma":[0.00004934802,0.0005156602,0.0001855865,0.0006120983,0.001015599,0.001242606,0.0009260702,0.0007995112,0.00006730873],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00027537,"about_ca_system_score_gemma":0.0009518872,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004747479,"about_ca_topic_score_gemma":0.00001863537,"domain_scores_codex":[0.9954202,0.00004067006,0.0004832585,0.001826496,0.001191115,0.001038224],"domain_scores_gemma":[0.9968432,0.0008161578,0.0001942744,0.001690966,0.00023476,0.0002207013],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001685871,0.00002175368,0.000004227088,0.00002848018,0.00001131303,0.00003924535,0.0002798069,0.02433208,0.0001261091,0.3186787,0.00002701934,0.6564344],"study_design_scores_gemma":[0.0002826231,0.0002357138,0.00001042161,0.0001515835,0.000003402424,0.00002315652,2.163624e-7,0.1455038,0.000608154,0.8474615,0.005213719,0.0005056537],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001746762,0.0003734426,0.9853903,0.0004045861,0.000877973,0.0007868533,0.00001333301,0.0002089369,0.01192711],"genre_scores_gemma":[0.06080859,0.0001252554,0.9352844,0.001480088,0.0006434228,0.00008658383,0.0000117592,0.00009643739,0.001463404],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6559288,"threshold_uncertainty_score":0.9997295,"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."}}