{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24662976,0.00028226152,0.73339605,0.00041629944,0.00006438853,0.00011181374,0.00016919136,0.00025386646,0.018676348],"genre_scores_gemma":[0.9285274,0.00022547133,0.06856388,0.00009606733,0.000029147579,0.0001090252,0.00016369837,0.000045159682,0.0022402522],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995733,0.00011165111,0.000024260133,0.00008926298,0.00014622363,0.00005525181],"domain_scores_gemma":[0.9989065,0.00049448264,0.00017311116,0.00021176189,0.00015723608,0.00005692997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006370555,0.0003143825,0.0002499102,0.0005802515,0.0003785594,0.0007113595,0.0005385207,0.00054472574,0.0013868106],"category_scores_gemma":[0.0026198158,0.0001529183,0.00048104336,0.00037403748,0.0016158728,0.00135081,0.0009585324,0.0009733342,0.000109651744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.000093297065,0.000033755623,0.0023378048,0.00014148037,0.000017223625,0.0012944883,0.0004891055,0.093201235,0.031531096,0.8438421,0.0006410972,0.02637728],"study_design_scores_gemma":[0.000024583385,0.000117569245,0.0017615411,0.00005250721,0.00002473101,0.0013058586,0.00014922704,0.39284453,0.027574262,0.5707378,0.005373396,0.000033980476],"about_ca_topic_score_codex":0.00059537526,"about_ca_topic_score_gemma":0.00048402755,"teacher_disagreement_score":0.0013868106,"about_ca_system_score_codex":0.00065022137,"about_ca_system_score_gemma":0.0005341328,"threshold_uncertainty_score":0.0047177672},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3809885,0.0009041854,0.5684955,0.0027545516,0.00071438134,0.00036626618,0.00030900558,0.0020746752,0.043392945],"genre_scores_gemma":[0.9609723,0.00024187767,0.03261328,0.00039691947,0.0001251304,0.000073849755,0.000100451754,0.00005338963,0.005422833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987464,0.00027426562,0.000052511605,0.00017045332,0.00046136786,0.00029497707],"domain_scores_gemma":[0.9986847,0.000436505,0.000121607074,0.00058253505,0.00010061756,0.000074064475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009206153,0.00042509646,0.0005301102,0.0004506647,0.00081932754,0.0009853006,0.0008412131,0.0012111097,0.0031822233],"category_scores_gemma":[0.0019002942,0.00024851685,0.000683208,0.0005401053,0.0017200788,0.0024647322,0.0029815827,0.0019130637,0.00056981173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.0013345783,0.00026412934,0.003747532,0.00027672044,0.00013419813,0.0017170202,0.0007737693,0.039539732,0.1255921,0.7100297,0.008210619,0.108379856],"study_design_scores_gemma":[0.00027462264,0.0009120487,0.002524917,0.00005990961,0.00007562927,0.002500183,0.00025963705,0.41812092,0.13699046,0.40172845,0.0364016,0.00015164354],"about_ca_topic_score_codex":0.0003267272,"about_ca_topic_score_gemma":0.0002997569,"teacher_disagreement_score":0.0031822233,"about_ca_system_score_codex":0.000685187,"about_ca_system_score_gemma":0.00061366573,"threshold_uncertainty_score":0.010645628},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20623167,0.0013130017,0.7611602,0.0013732662,0.00023439522,0.0001579281,0.0009120207,0.0011529402,0.027464554],"genre_scores_gemma":[0.80516243,0.00095069053,0.18137386,0.00023223009,0.00019824706,0.00029579856,0.000983591,0.00031130813,0.010491956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994711,0.00008927743,0.000044999877,0.0001365823,0.00015350533,0.00010455503],"domain_scores_gemma":[0.99778616,0.0012961667,0.00029169687,0.00019376169,0.00032476065,0.00010753754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004976447,0.00042616238,0.0006445312,0.0012835597,0.0005864626,0.0012784998,0.001003796,0.00062519027,0.0045908075],"category_scores_gemma":[0.006400609,0.00025493203,0.0006580703,0.0014885922,0.0011336051,0.002864676,0.00094903755,0.0010712867,0.0010096908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00021921347,0.00007681603,0.006738365,0.0005053456,0.00005121064,0.0010639713,0.0010293783,0.14270784,0.02104038,0.65854055,0.016914617,0.15111236],"study_design_scores_gemma":[0.000023424353,0.00008191839,0.0021974514,0.00005003179,0.000033886605,0.0009519798,0.00026370134,0.44373995,0.0052889683,0.53684276,0.010463824,0.00006218344],"about_ca_topic_score_codex":0.0012452044,"about_ca_topic_score_gemma":0.0014245381,"teacher_disagreement_score":0.0045908075,"about_ca_system_score_codex":0.0010154243,"about_ca_system_score_gemma":0.0004056714,"threshold_uncertainty_score":0.015357792},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2614658,0.0019494294,0.7068724,0.0015618117,0.00011217699,0.0001693927,0.00058690563,0.00057813665,0.026703993],"genre_scores_gemma":[0.9154643,0.0023407086,0.07308947,0.00026931375,0.00014325629,0.00018576029,0.00047603226,0.00016893387,0.007862257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990029,0.0003895091,0.0000391635,0.0001270451,0.00022458362,0.00021674878],"domain_scores_gemma":[0.99375653,0.004414777,0.00066283793,0.00054947764,0.0003367318,0.00027975932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011012129,0.0005270038,0.0008272522,0.0011008411,0.0011599809,0.001429143,0.0011582242,0.00065847335,0.0025883622],"category_scores_gemma":[0.0070622205,0.0003564026,0.00040530457,0.001675361,0.001446188,0.0027498584,0.0012553278,0.0010259598,0.0005084981],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.0004495968,0.0000482384,0.0007738368,0.00022538754,0.00003267446,0.00017102453,0.0004598739,0.34727708,0.0045666015,0.60729975,0.006001237,0.032694716],"study_design_scores_gemma":[0.000050739243,0.00010091963,0.00041313644,0.000034122262,0.000020778767,0.00016778358,0.00023743794,0.54727966,0.0014435613,0.44508603,0.005136599,0.000029298706],"about_ca_topic_score_codex":0.0061359773,"about_ca_topic_score_gemma":0.0057061347,"teacher_disagreement_score":0.0061359773,"about_ca_system_score_codex":0.0027827001,"about_ca_system_score_gemma":0.0011646249,"threshold_uncertainty_score":0.02019},"labels":[],"label_agreement":null}]}