{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":4,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":4,"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"},"query_hash":"22d9ec19b31e","filters":{"venue":"International Journal of Computer Mathematics Computer Systems Theory"}},"results":[{"id":"W3021987857","doi":"10.1080/23799927.2020.1764626","title":"The g -extra diagnosability of the generalized exchanged hypercube","year":2020,"lang":"en","type":"article","venue":"International Journal of Computer Mathematics Computer Systems Theory","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Brock University","funders":"","keywords":"Hypercube; Vertex (graph theory); Mathematics; Combinatorics; Graph; Property (philosophy); Set (abstract data type); Interconnection; Process (computing); Discrete mathematics; Computer science; Topology (electrical circuits)","retraction":null,"screen_n_in":null,"score":{"opus":0.02200707127934243,"gpt":0.234428073198466,"spread":0.2124210019191236,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002603622,0.0002564818,0.0005680168,0.00008886518,0.0001738155,0.0005676452,0.004801158,0.00008992314,0.0000089742],"category_scores_gemma":[0.0001176832,0.0001413836,0.0005377011,0.0002788209,0.0001483316,0.0003843525,0.0008396317,0.0003669886,0.00001624378],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000846448,"about_ca_system_score_gemma":0.0001128557,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006130789,"about_ca_topic_score_gemma":0.000001556626,"domain_scores_codex":[0.9957193,0.0009278372,0.001681309,0.0002586192,0.001161775,0.0002511559],"domain_scores_gemma":[0.9945814,0.001667683,0.001648613,0.0006869862,0.001274311,0.0001410021],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009648272,0.0003586964,0.0002198525,0.0002200311,0.001201623,0.00005709645,0.01127778,0.02545561,0.0003209273,0.8922339,0.04290264,0.02565533],"study_design_scores_gemma":[0.001177969,0.0003207484,0.0002314261,0.0006451818,0.00003980362,0.001086578,0.0001815739,0.9384636,0.0004647408,0.01664696,0.04044406,0.0002973446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01202235,0.0006028169,0.9672743,0.003660459,0.01574376,0.0003341526,0.000004989684,0.00004504354,0.0003121216],"genre_scores_gemma":[0.954147,0.00006339722,0.03687614,0.0012432,0.007501069,0.00001498006,8.012281e-7,0.00003242919,0.0001209194],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9421247,"threshold_uncertainty_score":0.8921826,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3208713480","doi":"10.1080/23799927.2021.2018115","title":"An adaptive attack on 2-SIDH","year":2021,"lang":"en","type":"preprint","venue":"International Journal of Computer Mathematics Computer Systems Theory","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":3,"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":"Marsden Fund; Ministry of Business, Innovation and Employment","keywords":"Computer science; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.05048415019322754,"gpt":0.3336973022584039,"spread":0.2832131520651764,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.002303705,0.0005835794,0.001029526,0.001024125,0.000113193,0.002649055,0.005481958,0.0002699736,0.00002478444],"category_scores_gemma":[0.00002233492,0.0005207449,0.0006865755,0.0002415415,0.00008598406,0.0008080064,0.001893779,0.001055326,0.00001620402],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002495766,"about_ca_system_score_gemma":0.0004288315,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001055038,"about_ca_topic_score_gemma":0.000002857447,"domain_scores_codex":[0.994221,0.000856368,0.002009628,0.0006695781,0.001879532,0.0003638884],"domain_scores_gemma":[0.9926446,0.0007980503,0.002352816,0.001371993,0.002559358,0.0002731624],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007723538,0.001998204,0.00003240057,0.0002452425,0.002391636,0.001097936,0.01235971,0.1024253,0.00002676025,0.8404496,0.006202099,0.0326939],"study_design_scores_gemma":[0.00108654,0.001068569,0.0002094553,0.002442185,0.00007760691,0.001527739,0.0003967466,0.9476135,0.00007733903,0.04333141,0.001445574,0.0007232849],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0349759,0.0003034913,0.9384029,0.0002865004,0.02532181,0.0003547294,0.00003264412,0.0001058062,0.0002162128],"genre_scores_gemma":[0.4729469,0.00006073312,0.5209717,0.0006002869,0.005299162,0.00001670883,0.00003830476,0.00004916597,0.00001703033],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8451883,"threshold_uncertainty_score":0.9998989,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4406481255","doi":"10.1080/23799927.2025.2454546","title":"On messy broadcasting in directed hyper-cylinder graphs","year":2025,"lang":"en","type":"article","venue":"International Journal of Computer Mathematics Computer Systems Theory","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Broadcasting (networking); Computer science; Mathematics; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.01152415447343975,"gpt":0.2554768673040764,"spread":0.2439527128306367,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002429684,0.0003227429,0.0006965225,0.001432872,0.00007920858,0.0007056542,0.002444328,0.0001437359,0.000007553816],"category_scores_gemma":[0.00007477655,0.000267232,0.0003075282,0.0005545792,0.00004608549,0.0005013883,0.000418765,0.000485459,0.00002028761],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002273597,"about_ca_system_score_gemma":0.0001255984,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009158715,"about_ca_topic_score_gemma":0.000002256835,"domain_scores_codex":[0.9961728,0.0005483546,0.001750651,0.0003641192,0.0008419515,0.0003221486],"domain_scores_gemma":[0.9957767,0.001689073,0.000951658,0.0005029146,0.0009830319,0.00009665739],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004886797,0.0003960129,0.0001607227,0.00008556484,0.000409106,0.0001816115,0.001464078,0.0367264,0.00003206204,0.9345823,0.005400199,0.02051309],"study_design_scores_gemma":[0.001428439,0.0002025943,0.0004308868,0.003228812,0.00001452058,0.0008375004,0.00007124393,0.9008715,0.00004850154,0.09055754,0.002018912,0.00028959],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02347301,0.0002770777,0.9480725,0.0002907688,0.02496296,0.0002334796,0.00000164737,0.0001198009,0.002568745],"genre_scores_gemma":[0.9311149,0.00001702485,0.06621441,0.0007076995,0.001575898,0.00001213011,0.000001634106,0.00002596823,0.0003303654],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9076418,"threshold_uncertainty_score":0.999978,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4403638487","doi":"10.1080/23799927.2024.2416513","title":"A recurrence for the surface area of ( n, k )-arrangement graphs","year":2024,"lang":"en","type":"article","venue":"International Journal of Computer Mathematics Computer Systems Theory","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Brock University","funders":"","keywords":"Surface (topology); Combinatorics; Mathematics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.02415245441467564,"gpt":0.2652987174020755,"spread":0.2411462629873999,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003429088,0.0002426834,0.0004862662,0.0002951675,0.00007683003,0.0007938691,0.002691254,0.00007393473,0.000006303992],"category_scores_gemma":[0.00002555673,0.0001542858,0.000499354,0.0002768268,0.00007302441,0.0004847665,0.0003097177,0.000236361,0.000007811698],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008317826,"about_ca_system_score_gemma":0.0001130403,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004151776,"about_ca_topic_score_gemma":6.990331e-7,"domain_scores_codex":[0.9969992,0.0002193762,0.001433914,0.0002649432,0.0008558886,0.0002266511],"domain_scores_gemma":[0.9946325,0.002693016,0.0008107696,0.0004751422,0.00131216,0.00007638245],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003103128,0.0001433575,0.00001157833,0.0003513504,0.001179509,0.00004367002,0.003569977,0.03322963,0.00007919311,0.905991,0.02795716,0.02741252],"study_design_scores_gemma":[0.0003831825,0.0002774335,0.0000128226,0.002085473,0.000042678,0.00100305,0.00009699543,0.9414219,0.0001023991,0.03140554,0.02299526,0.0001732512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001728323,0.003374176,0.9561255,0.0005990603,0.03752085,0.0004179883,0.00001297514,0.00005962788,0.0001614815],"genre_scores_gemma":[0.8381938,0.0001693944,0.1571241,0.0002403832,0.003964918,0.00002605929,0.0000025806,0.00003969733,0.0002391158],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9081923,"threshold_uncertainty_score":0.7655298,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}