{"meta":{"query_hash":"e272847eb984","filters":{"venue":"Nordic journal of computing"},"cohort_total":2,"direct_labels_cover":0,"predictions_cover":2,"exported":2,"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/e272847eb984","api":"https://metacan.xera.ac/api/v1/cohort?venue=Nordic+journal+of+computing"},"results":[{"id":"W141499786","doi":"","title":"Tracking mobile users in cellular networks using timing information","year":2008,"lang":"en","type":"article","venue":"Nordic journal of computing","topic":"Wireless Communication Networks Research","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":"Carleton University","funders":"","keywords":"Computer science; Node (physics); Network topology; Tracking (education); Computer network; Cellular network; Upper and lower bounds; Distributed computing; Mathematics","score_opus":0.05304563476310745,"score_gpt":0.30023572306176244,"score_spread":0.247190088298655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W141499786","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45585302,0.00036154003,0.5434073,0.00003791821,0.0001647831,0.000060129943,3.0977297e-8,0.000015712181,0.00009951749],"genre_scores_gemma":[0.9448944,0.00010693242,0.054756228,0.00007099334,0.00016051448,5.2614433e-7,6.8361186e-7,0.000007947775,0.0000018216044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978491,0.00025853975,0.0008696412,0.0001028655,0.0005428998,0.0003769206],"domain_scores_gemma":[0.9982015,0.00034990144,0.00062610715,0.00036702823,0.00034919038,0.00010627323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00169683,0.00011782643,0.00026060006,0.0004845369,0.00028192296,0.00016668446,0.0013053918,0.000076880184,0.000004174741],"category_scores_gemma":[0.00008117612,0.000118863405,0.00009587413,0.00095908664,0.00005538769,0.001976208,0.0003812289,0.0007740602,0.0000034792727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.000004914713,0.000024487059,0.0075252205,0.000007376053,0.000009890863,0.000043214117,0.002404794,0.9193214,0.00016894238,0.00012965791,0.00004515426,0.07031496],"study_design_scores_gemma":[0.00043198295,0.000043838605,0.0031666807,0.0001915401,0.0000022834154,0.00033230835,0.00014452988,0.9949648,0.00023175501,0.00003576719,0.00034318137,0.00011135434],"about_ca_topic_score_codex":0.000027928003,"about_ca_topic_score_gemma":0.0000024255526,"teacher_disagreement_score":0.48904133,"about_ca_system_score_codex":0.00018918217,"about_ca_system_score_gemma":0.00020520166,"threshold_uncertainty_score":0.4847109},"labels":[],"label_agreement":null},{"id":"W2105718332","doi":"10.5555/1145884.1145886","title":"Modeling and verification of cryptographic protocols using coloured petri nets and design/CPN","year":2005,"lang":"en","type":"article","venue":"Nordic journal of computing","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Petri net; Computer science; Cryptographic protocol; Protocol (science); Graph; Cryptographic primitive; Cryptography; Theoretical computer science; Distributed computing; Programming language; Algorithm","score_opus":0.05432905837601662,"score_gpt":0.33469342474714925,"score_spread":0.2803643663711326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105718332","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.20455316,0.00015417898,0.791153,0.0001282557,0.0000264792,0.0039631287,1.53493e-7,0.000015000313,0.000006613877],"genre_scores_gemma":[0.6231213,0.0000052739383,0.37675777,0.000024119669,0.000040069634,0.00004602227,5.0878e-8,0.000005077344,3.3332662e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849695,0.00015298814,0.00067504466,0.00018761204,0.00030927264,0.00017814414],"domain_scores_gemma":[0.9985091,0.0001252916,0.0006992362,0.00019986877,0.00036771077,0.00009875724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011903383,0.00011577432,0.00025924714,0.00024141047,0.00014480401,0.00009331203,0.00034701978,0.000051599513,0.0000012308359],"category_scores_gemma":[0.0001240667,0.00011130611,0.000046738853,0.00035434848,0.00006569544,0.00060487416,0.00012656946,0.00020959944,2.3071219e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.00013300347,0.00033255797,0.006174007,0.0002687708,0.000090754824,0.000008596925,0.0075450577,0.67025876,0.053986117,0.027369125,0.000006921794,0.23382632],"study_design_scores_gemma":[0.00074803986,0.00013933952,0.000844627,0.00028700588,0.0000105404215,0.00014646974,0.00003713948,0.986135,0.0024733287,0.009035818,0.000042240383,0.000100431454],"about_ca_topic_score_codex":0.0000028119803,"about_ca_topic_score_gemma":5.927812e-7,"teacher_disagreement_score":0.41856813,"about_ca_system_score_codex":0.000036126057,"about_ca_system_score_gemma":0.00010835313,"threshold_uncertainty_score":0.45389313},"labels":[],"label_agreement":null}]}