{"meta":{"query_hash":"22d9ec19b31e","filters":{"venue":"International Journal of Computer Mathematics Computer Systems Theory"},"cohort_total":4,"direct_labels_cover":0,"predictions_cover":4,"exported":4,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/22d9ec19b31e","api":"https://metacan.xera.ac/api/v1/cohort?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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.022007071279342434,"score_gpt":0.234428073198466,"score_spread":0.21242100191912358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021987857","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012022345,0.0006028169,0.9672743,0.0036604588,0.015743764,0.00033415263,0.0000049896844,0.000045043536,0.00031212164],"genre_scores_gemma":[0.95414704,0.00006339722,0.03687614,0.0012431997,0.0075010695,0.000014980055,8.012281e-7,0.00003242919,0.00012091935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957193,0.00092783716,0.0016813091,0.0002586192,0.0011617751,0.00025115593],"domain_scores_gemma":[0.9945814,0.0016676825,0.0016486127,0.0006869862,0.0012743113,0.00014100212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026036224,0.00025648176,0.00056801684,0.00008886518,0.00017381551,0.0005676452,0.004801158,0.00008992314,0.0000089742],"category_scores_gemma":[0.00011768317,0.00014138359,0.00053770107,0.0002788209,0.00014833159,0.0003843525,0.00083963166,0.00036698862,0.000016243785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009648272,0.00035869644,0.00021985253,0.00022003113,0.0012016227,0.000057096455,0.011277779,0.025455605,0.0003209273,0.8922339,0.04290264,0.025655335],"study_design_scores_gemma":[0.0011779688,0.0003207484,0.0002314261,0.0006451818,0.000039803625,0.0010865779,0.0001815739,0.9384636,0.00046474082,0.016646959,0.040444065,0.00029734455],"about_ca_topic_score_codex":0.0000061307887,"about_ca_topic_score_gemma":0.0000015566259,"teacher_disagreement_score":0.9421247,"about_ca_system_score_codex":0.0000846448,"about_ca_system_score_gemma":0.00011285569,"threshold_uncertainty_score":0.8921826},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Marsden Fund; Ministry of Business, Innovation and Employment","keywords":"Computer science; Computer security","score_opus":0.05048415019322754,"score_gpt":0.33369730225840394,"score_spread":0.2832131520651764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3208713480","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034975905,0.00030349125,0.9384029,0.00028650044,0.025321813,0.0003547294,0.00003264412,0.00010580622,0.00021621276],"genre_scores_gemma":[0.4729469,0.000060733124,0.5209717,0.00060028693,0.005299162,0.000016708833,0.000038304755,0.00004916597,0.000017030328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99422103,0.00085636805,0.0020096279,0.0006695781,0.001879532,0.00036388842],"domain_scores_gemma":[0.9926446,0.0007980503,0.002352816,0.001371993,0.0025593576,0.00027316244],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0023037049,0.00058357936,0.0010295259,0.0010241247,0.000113193004,0.0026490546,0.0054819584,0.00026997362,0.000024784444],"category_scores_gemma":[0.000022334916,0.00052074494,0.00068657554,0.00024154152,0.00008598406,0.00080800644,0.0018937787,0.0010553264,0.00001620402],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007723538,0.001998204,0.000032400567,0.00024524247,0.0023916357,0.0010979364,0.012359713,0.10242527,0.000026760254,0.84044963,0.006202099,0.032693896],"study_design_scores_gemma":[0.0010865403,0.0010685686,0.00020945528,0.002442185,0.00007760691,0.0015277391,0.00039674656,0.94761354,0.000077339035,0.04333141,0.0014455742,0.0007232849],"about_ca_topic_score_codex":0.00001055038,"about_ca_topic_score_gemma":0.0000028574466,"teacher_disagreement_score":0.84518826,"about_ca_system_score_codex":0.00024957655,"about_ca_system_score_gemma":0.0004288315,"threshold_uncertainty_score":0.99989885},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Surface (topology); Combinatorics; Mathematics; Geometry","score_opus":0.02415245441467564,"score_gpt":0.2652987174020755,"score_spread":0.24114626298739986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403638487","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017283233,0.0033741759,0.9561255,0.00059906027,0.037520852,0.0004179883,0.000012975137,0.000059627884,0.00016148153],"genre_scores_gemma":[0.8381938,0.0001693944,0.15712409,0.00024038316,0.003964918,0.00002605929,0.0000025806003,0.00003969733,0.0002391158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969992,0.00021937623,0.0014339137,0.0002649432,0.0008558886,0.00022665113],"domain_scores_gemma":[0.99463254,0.0026930158,0.00081076956,0.0004751422,0.0013121597,0.00007638245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034290883,0.0002426834,0.00048626622,0.00029516753,0.00007683003,0.0007938691,0.0026912536,0.00007393473,0.000006303992],"category_scores_gemma":[0.00002555673,0.0001542858,0.00049935404,0.0002768268,0.00007302441,0.00048476647,0.00030971767,0.000236361,0.000007811698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031031275,0.00014335752,0.00001157833,0.00035135043,0.0011795089,0.000043670017,0.0035699767,0.033229634,0.00007919311,0.905991,0.027957158,0.027412517],"study_design_scores_gemma":[0.00038318252,0.00027743354,0.000012822605,0.0020854734,0.000042678003,0.0010030499,0.00009699543,0.9414219,0.000102399135,0.031405542,0.022995258,0.00017325125],"about_ca_topic_score_codex":0.0000041517765,"about_ca_topic_score_gemma":6.990331e-7,"teacher_disagreement_score":0.9081923,"about_ca_system_score_codex":0.00008317826,"about_ca_system_score_gemma":0.00011304029,"threshold_uncertainty_score":0.76552975},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Broadcasting (networking); Computer science; Mathematics; Computer network","score_opus":0.011524154473439753,"score_gpt":0.2554768673040764,"score_spread":0.2439527128306367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406481255","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023473011,0.0002770777,0.9480725,0.00029076883,0.024962964,0.00023347957,0.0000016473704,0.0001198009,0.0025687446],"genre_scores_gemma":[0.93111485,0.000017024853,0.06621441,0.00070769945,0.0015758984,0.000012130114,0.0000016341062,0.000025968226,0.0003303654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961728,0.0005483546,0.0017506512,0.00036411916,0.00084195146,0.00032214864],"domain_scores_gemma":[0.99577665,0.0016890729,0.000951658,0.0005029146,0.0009830319,0.000096657386],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024296842,0.00032274288,0.0006965225,0.001432872,0.00007920858,0.0007056542,0.002444328,0.00014373586,0.000007553816],"category_scores_gemma":[0.00007477655,0.00026723195,0.00030752816,0.0005545792,0.00004608549,0.00050138833,0.000418765,0.00048545902,0.000020287609],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004886797,0.0003960129,0.00016072275,0.00008556484,0.00040910603,0.00018161151,0.0014640779,0.036726397,0.00003206204,0.9345823,0.0054001985,0.020513086],"study_design_scores_gemma":[0.0014284388,0.00020259425,0.00043088678,0.0032288122,0.000014520585,0.0008375004,0.00007124393,0.90087146,0.000048501544,0.09055754,0.0020189115,0.00028958998],"about_ca_topic_score_codex":0.000009158715,"about_ca_topic_score_gemma":0.0000022568352,"teacher_disagreement_score":0.9076418,"about_ca_system_score_codex":0.00022735968,"about_ca_system_score_gemma":0.00012559835,"threshold_uncertainty_score":0.999978},"labels":[],"label_agreement":null}]}