{"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":"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.14301056,0.0018364927,0.8489979,0.0009552664,0.00010660391,0.00025689104,0.0004643044,0.000738468,0.0036334773],"genre_scores_gemma":[0.9145474,0.0013366239,0.08118818,0.000088991525,0.00012790372,0.0001677432,0.00041005222,0.000040688075,0.0020925172],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986357,0.00045655662,0.00007934468,0.00031282465,0.00028568786,0.00022973557],"domain_scores_gemma":[0.9914784,0.0064386716,0.00090500317,0.00034138976,0.00052339764,0.00031316484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017279718,0.0015055242,0.001291107,0.0014678304,0.001139395,0.0021062524,0.002324613,0.0019895497,0.0009768095],"category_scores_gemma":[0.011835458,0.00073126116,0.00065962464,0.002949375,0.0011600378,0.0029623571,0.0017005776,0.00081423204,0.00027987774],"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.00031923503,0.000048054495,0.0044871005,0.00011156,0.000059151855,0.000227058,0.00012837784,0.95135856,0.0018980284,0.014131284,0.00070987374,0.026521673],"study_design_scores_gemma":[0.000020156804,0.000044095712,0.0003783245,0.0000058851447,0.000026374782,0.00008129323,0.00004429013,0.99125344,0.00075587304,0.006908837,0.00046921786,0.000012155626],"about_ca_topic_score_codex":0.014667906,"about_ca_topic_score_gemma":0.008108988,"teacher_disagreement_score":0.014667906,"about_ca_system_score_codex":0.0017477609,"about_ca_system_score_gemma":0.0009013243,"threshold_uncertainty_score":0.02916503},"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":"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.002629041,0.000052108528,0.99585426,0.00006053689,0.000019065099,0.00009051051,0.0000352553,0.00036512385,0.0008941502],"genre_scores_gemma":[0.14082476,0.0003744439,0.85615367,0.000110869965,0.000031359694,0.00045609532,0.00017609079,0.00016072133,0.0017119756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99515486,0.0016758558,0.00044461674,0.00063328823,0.0017790548,0.0003124033],"domain_scores_gemma":[0.9954862,0.0022127945,0.0006238775,0.0010704555,0.00051380903,0.00009276959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042572925,0.0011011878,0.0006044005,0.0012302388,0.0008069747,0.0018718498,0.002257032,0.0011453971,0.0016557565],"category_scores_gemma":[0.006995907,0.0009491552,0.0019087591,0.000866411,0.0032130277,0.0034926927,0.0016912597,0.0024515875,0.00043193897],"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.00014967116,0.00011146042,0.0010074954,0.0005005204,0.00008468098,0.0006226271,0.00053320604,0.52229893,0.019476594,0.40960705,0.000757857,0.044849865],"study_design_scores_gemma":[0.000052039508,0.000079354024,0.00023257919,0.00011304066,0.00007896042,0.00023121532,0.00005503144,0.82186705,0.025569525,0.1391579,0.012518225,0.000045017285],"about_ca_topic_score_codex":0.007901343,"about_ca_topic_score_gemma":0.0066760234,"teacher_disagreement_score":0.007901343,"about_ca_system_score_codex":0.002245065,"about_ca_system_score_gemma":0.0037052827,"threshold_uncertainty_score":0.022514999},"labels":[],"label_agreement":null}]}