{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":3,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":3,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"bf3384e7a90e","filters":{"venue":"Computing and Informatics / Computers and Artificial Intelligence"}},"results":[{"id":"W2536934950","doi":"","title":"IPO: An Inclined Planes System Optimization Algorithm","year":2016,"lang":"en","type":"article","venue":"Computing and Informatics / Computers and Artificial Intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Benchmark (surveying); Heuristic; Plane (geometry); Algorithm; Inclined plane; Motion (physics); Computer science; Space (punctuation); Optimization algorithm; Mathematical optimization; Mathematics; Artificial intelligence; Engineering; Geometry; Mechanical engineering","authors":[{"name":"M. Hamed Mozaffari","is_ca":true},{"name":"Hamed Abdy","is_ca":false},{"name":"Seyed Hamid Zahiri","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03183234500161008,"gpt":0.2880545947611222,"spread":0.2562222497595121,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005362795,0.0009450484,0.001087321,0.0007291162,0.0005391473,0.0008808655,0.001446437,0.001390139,0.006623357],"category_scores_gemma":[0.001196983,0.0004265842,0.0006890844,0.000972683,0.0004347681,0.00085096,0.001235339,0.001165339,0.00147333],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000403158,"about_ca_system_score_gemma":0.001437286,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00306494,"about_ca_topic_score_gemma":0.001985219,"domain_scores_codex":[0.9996852,0.00008324037,0.00001649868,0.00006276833,0.0001097172,0.00004260886],"domain_scores_gemma":[0.9997861,0.00008571576,0.00002915479,0.00002553562,0.00005414962,0.0000193476],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001730072,0.0001026264,0.0008614075,0.0001210582,0.00007623952,0.00009054937,0.0000538758,0.806405,0.00173797,0.009656088,0.006001483,0.1747207],"study_design_scores_gemma":[0.00004090452,0.00004989395,0.0001102738,0.00000913197,0.00000904538,0.00002470686,0.000008200199,0.9942054,0.0003650083,0.002056189,0.003115775,0.000005398555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0097814,0.0004106485,0.9782908,0.000203818,0.0001118819,0.0001646903,0.000159224,0.001090161,0.009787437],"genre_scores_gemma":[0.2393241,0.0004624528,0.749288,0.000291001,0.0001081969,0.0008152947,0.0007069063,0.0003566078,0.008647525],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006623357,"threshold_uncertainty_score":0.02215731,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W22316296","doi":"10.1089/jmf.2011.1827","title":"Mining Large Data Sets on Grids: Issues and Prospects","year":2002,"lang":"en","type":"article","venue":"Computing and Informatics / Computers and Artificial Intelligence","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Computation; Grid; Knowledge extraction; Distributed computing; Data science; Grid computing; Data grid; Data mining; Scale (ratio)","authors":[{"name":"David B. Skillicorn","is_ca":true},{"name":"Domenico Talia","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07509896457680171,"gpt":0.3029576007569295,"spread":0.2278586361801278,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01275002,0.001319699,0.003755508,0.003387922,0.001295767,0.006229393,0.006245818,0.002466052,0.005069372],"category_scores_gemma":[0.0418864,0.001366749,0.002543093,0.01120844,0.001947265,0.01352701,0.00377631,0.002749862,0.002592533],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00139178,"about_ca_system_score_gemma":0.002373466,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006633153,"about_ca_topic_score_gemma":0.007704956,"domain_scores_codex":[0.9937888,0.002424545,0.000614543,0.001651291,0.001248061,0.0002728124],"domain_scores_gemma":[0.9399803,0.03678157,0.002016353,0.0131262,0.005847345,0.002248313],"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.001163026,0.0007648727,0.06296282,0.002303494,0.001426328,0.001511911,0.001154682,0.1824235,0.00243397,0.06979336,0.08813602,0.585926],"study_design_scores_gemma":[0.0001491656,0.000191043,0.009049908,0.0003961355,0.00008439892,0.0008540206,0.002500114,0.6068925,0.001341949,0.323557,0.05489558,0.00008818619],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.1510474,0.03322861,0.6929386,0.08470788,0.002446783,0.0008421086,0.01730009,0.00790647,0.009582037],"genre_scores_gemma":[0.381497,0.01380256,0.5730766,0.003293256,0.002089852,0.0007177355,0.0205793,0.0006699253,0.004273732],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.01275002,"threshold_uncertainty_score":0.0674293,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W12814185","doi":"10.1023/a:1023679303322","title":"MULTILEVEL AGGREGATION METHODS FOR SMALL-WORLD GRAPHS WITH APPLICATION TO RANDOM-WALK RANKING","year":2011,"lang":"en","type":"article","venue":"Computing and Informatics / Computers and Artificial Intelligence","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Markov chain; Computer science; Theoretical computer science; Random walk; Graph; Cluster analysis; Mathematics; Algorithm; Machine learning","authors":[{"name":"Hans De Sterck","is_ca":true},{"name":"Van Emden Henson","is_ca":false},{"name":"Geoffrey Sanders","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04849255361357132,"gpt":0.3277189366690197,"spread":0.2792263830554484,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005722894,0.001769038,0.0030051,0.005055821,0.001317511,0.002322052,0.00290281,0.001764495,0.006317453],"category_scores_gemma":[0.02122074,0.001120612,0.003124556,0.004407284,0.001216875,0.002653779,0.00418935,0.00334555,0.001880222],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001856467,"about_ca_system_score_gemma":0.002280596,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01477476,"about_ca_topic_score_gemma":0.01597612,"domain_scores_codex":[0.9962617,0.002083366,0.0002531414,0.0005755514,0.0005942743,0.0002320038],"domain_scores_gemma":[0.9877061,0.008532156,0.0009248605,0.001242815,0.001190275,0.0004037454],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001036124,0.0000831182,0.001390284,0.0002903629,0.0003351025,0.000149965,0.0001626724,0.7594187,0.0007227301,0.08950719,0.005056995,0.1427792],"study_design_scores_gemma":[0.000009287259,0.00002091559,0.0001052079,0.00000847507,0.00001232992,0.00001178556,0.000009658244,0.9704378,0.0000728571,0.02806735,0.00123469,0.000009649737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001292817,0.0001757084,0.9971366,0.00008872082,0.0000415629,0.0000632659,0.0001240067,0.0007675563,0.0003098061],"genre_scores_gemma":[0.08835103,0.0004837366,0.905467,0.0001158563,0.0001864358,0.0009927504,0.001177995,0.0005639912,0.002661196],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01477476,"threshold_uncertainty_score":0.03026593,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}