{"id":"W2884836385","doi":"10.1016/j.dam.2018.01.018","title":"The robot crawler graph process","year":2018,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"McGill University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Ryerson University","keywords":"Web crawler; Crawling; Robot; Graph; Mathematics; Random walk; Combinatorics; Theoretical computer science; Discrete mathematics; Computer science; Artificial intelligence; Statistics; World Wide Web","routes":{"ca_aff":true,"ca_fund":true,"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.0003771628,0.000126559,0.0001175417,0.00004308759,0.0004773453,0.0003640185,0.001074929,0.00004343525,0.00002903569],"category_scores_gemma":[0.00003573075,0.0000779185,0.00004051071,0.0004298531,0.0002002233,0.0001523886,0.0001953067,0.0001044337,0.0002792739],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009949917,"about_ca_system_score_gemma":0.00004358137,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.101983e-7,"about_ca_topic_score_gemma":0.00000381853,"domain_scores_codex":[0.998838,0.0000126142,0.0002394199,0.000227697,0.0003614593,0.0003207909],"domain_scores_gemma":[0.9989061,0.0001076264,0.00009958738,0.0006639849,0.0001338077,0.00008885597],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002371755,0.00003890136,0.000003470035,0.00003587914,0.00001636148,5.397862e-7,0.003191755,0.0001893836,0.0004524119,0.9907441,0.001328904,0.003995944],"study_design_scores_gemma":[0.0004409615,0.00008446961,0.00004339576,0.00003428124,0.00001101067,0.000008486059,0.0007878282,0.287205,0.006954497,0.6973007,0.006735259,0.0003941281],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003518988,0.00001620186,0.9215878,0.000851849,0.00009382692,0.0003218966,7.359408e-7,0.0001875795,0.07658823],"genre_scores_gemma":[0.4862657,0.00005152084,0.51089,0.0007346367,0.0001749476,0.0002171817,0.00000464578,0.00004144458,0.001619942],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4859138,"threshold_uncertainty_score":0.3671402,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01797198649290646,"score_gpt":0.2813735515502793,"score_spread":0.2634015650573728,"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."}}