{"meta":{"query_hash":"ce7709b5824d","filters":{"venue":"International Journal of Networking and Computing"},"cohort_total":7,"direct_labels_cover":0,"predictions_cover":7,"exported":7,"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/ce7709b5824d","api":"https://metacan.xera.ac/api/v1/cohort?venue=International+Journal+of+Networking+and+Computing"},"results":[{"id":"W1880498013","doi":"10.15803/ijnc.4.1_88","title":"Supporting Decentralized SPARQL Queries in an Ad-Hoc Semantic Web Data Sharing System","year":2014,"lang":"en","type":"article","venue":"International Journal of Networking and Computing","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"University of Ottawa; China Postdoctoral Science Foundation; National High-tech Research and Development Program; National Key Research and Development Program of China; China Scholarship Council; National Natural Science Foundation of China","keywords":"Computer science; SPARQL; Named graph; RDF; Scalability; Semantic Web; Information retrieval; World Wide Web; Query optimization; RDF query language; Database; Web search query; Web query classification; Search engine","score_opus":0.04229164176653147,"score_gpt":0.3304502073818049,"score_spread":0.2881585656152734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1880498013","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6156209,0.0007487988,0.38019267,0.0011146,0.0020017049,0.000060965867,7.8580774e-7,0.00015430312,0.000105288775],"genre_scores_gemma":[0.92728543,0.00006275956,0.071821295,0.00015707352,0.0006527785,5.083251e-7,0.000003070004,0.000011953432,0.0000051101283],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99766254,0.00012511213,0.000833896,0.00044233227,0.0005129601,0.0004231374],"domain_scores_gemma":[0.998187,0.00032815023,0.0006349506,0.0005142863,0.00021688173,0.000118709606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028330102,0.0001677332,0.00032834586,0.00034525804,0.00010802563,0.0006617514,0.0037306545,0.00007113597,7.9675954e-7],"category_scores_gemma":[0.00022125695,0.00016067644,0.000042539617,0.00030871484,0.000034151457,0.00069154095,0.0020788927,0.00037073786,0.0000020154016],"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.00006898692,0.000067436624,0.12463309,0.000042180916,0.0001266367,0.0004217397,0.0015882676,0.04022094,0.000490297,0.009987222,0.0005958111,0.8217574],"study_design_scores_gemma":[0.0004987946,0.00008571465,0.005014956,0.0011201304,0.00000813992,0.00054319005,0.0002269166,0.98696625,0.000031598967,0.0009800984,0.004340284,0.00018392222],"about_ca_topic_score_codex":0.00001038746,"about_ca_topic_score_gemma":0.000051844552,"teacher_disagreement_score":0.94674534,"about_ca_system_score_codex":0.00011543647,"about_ca_system_score_gemma":0.000047337988,"threshold_uncertainty_score":0.6932546},"labels":[],"label_agreement":null},{"id":"W2022105839","doi":"10.15803/ijnc.5.1_61","title":"Handling Non-determinism with Description Logics using a Fork/Join Approach","year":2015,"lang":"en","type":"article","venue":"International Journal of Networking and Computing","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Natural Sciences and Engineering Research Council of Canada; Atlantic Canada Opportunities Agency","keywords":"Computer science; Cardinality (data modeling); Semantic reasoner; Laptop; Theoretical computer science; Description logic; Determinism; Fork (system call); Programming language; Join (topology); Ontology; Ontology language; Artificial intelligence; Semantic Web; Database","score_opus":0.08842439412181259,"score_gpt":0.28803734330467035,"score_spread":0.19961294918285777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022105839","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.33447608,0.00042888732,0.66362345,0.00008234078,0.0009998851,0.000023192217,5.1214077e-8,0.000016827895,0.0003492967],"genre_scores_gemma":[0.7572582,0.000016224601,0.24181125,0.000091116104,0.000813376,1.3910287e-7,2.3142047e-7,0.0000044929807,0.000004982818],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989031,0.000051781975,0.00032224756,0.00015300579,0.00039538826,0.00017450008],"domain_scores_gemma":[0.99896866,0.00011443818,0.00040781035,0.00008786176,0.0003406001,0.0000805991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007933628,0.00010678594,0.0001832616,0.00013330494,0.00008685576,0.00039134314,0.0005099761,0.000047217927,1.1391268e-7],"category_scores_gemma":[0.00003946439,0.00008056998,0.000045503417,0.00011156104,0.00003798894,0.0003632698,0.00019072223,0.00019209814,2.5568613e-7],"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.0002949816,0.000252147,0.08802596,0.000043711647,0.0005355347,0.0010058393,0.01345854,0.34216732,0.00078223797,0.0050958903,0.0004436594,0.5478942],"study_design_scores_gemma":[0.00073865906,0.0001549257,0.0013497008,0.00033131096,0.000014257181,0.0027155008,0.0004359583,0.9914474,0.00004320099,0.0023139191,0.0003329423,0.00012223609],"about_ca_topic_score_codex":0.000013153522,"about_ca_topic_score_gemma":0.0000011770206,"teacher_disagreement_score":0.6492801,"about_ca_system_score_codex":0.00006310851,"about_ca_system_score_gemma":0.00009468466,"threshold_uncertainty_score":0.3773731},"labels":[],"label_agreement":null},{"id":"W2739312141","doi":"10.15803/ijnc.7.2_336","title":"On the Cost of Waking Up","year":2017,"lang":"en","type":"article","venue":"International Journal of Networking and Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Vedecká Grantová Agentúra MŠVVaŠ SR a SAV","keywords":"Computer science; Asynchronous communication; Hypercube; Bipartite graph; Broadcasting (networking); Enhanced Data Rates for GSM Evolution; Task (project management); Interconnection; Flooding (psychology); Computer network; Theoretical computer science; Distributed computing; Parallel computing; Graph; Telecommunications","score_opus":0.03430785495083603,"score_gpt":0.30465639012498613,"score_spread":0.2703485351741501,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2739312141","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.26287216,0.0004371127,0.7218475,0.0033826358,0.007924198,0.00005941434,0.0000014916277,0.0000115385765,0.0034639616],"genre_scores_gemma":[0.99832714,0.000021182997,0.0007772946,0.00013177352,0.0007223703,1.6314294e-7,1.224513e-7,0.0000024993685,0.000017472183],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999166,0.00004277684,0.00029645473,0.00008116239,0.0003194307,0.00009415811],"domain_scores_gemma":[0.9983408,0.00035264308,0.0008589838,0.00017993418,0.00023960524,0.000028039522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008018879,0.000058901707,0.00011996952,0.000037261245,0.00022327343,0.00038616682,0.0012627689,0.00002203248,9.851871e-7],"category_scores_gemma":[0.00010997048,0.000039004688,0.000059359954,0.000027982078,0.000041795047,0.00014864941,0.00020613268,0.00016489787,6.104847e-7],"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.00003239617,0.000038382077,0.00658328,0.0000064061633,0.00016763876,0.00006989693,0.00096942706,0.008107618,0.0001472069,0.16497509,0.0020235304,0.81687915],"study_design_scores_gemma":[0.0013062368,0.0001617216,0.039304346,0.003071023,0.0000132276145,0.00064483186,0.00015128539,0.91188896,0.0003213852,0.013879005,0.029018577,0.00023938972],"about_ca_topic_score_codex":0.000009639689,"about_ca_topic_score_gemma":8.6450854e-7,"teacher_disagreement_score":0.90378135,"about_ca_system_score_codex":0.000017602135,"about_ca_system_score_gemma":0.000021983005,"threshold_uncertainty_score":0.37238157},"labels":[],"label_agreement":null},{"id":"W2916341396","doi":"10.15803/ijnc.9.1_1","title":"Preface: Special Issue on Workshop on Advances in Parallel and Distributed Computational Models 2018","year":2019,"lang":"en","type":"article","venue":"International Journal of Networking and Computing","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Editorial board; Field (mathematics); Process (computing); Library science; Engineering ethics; Operations research; Data science","score_opus":0.014713159464043066,"score_gpt":0.26648115757498736,"score_spread":0.2517679981109443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2916341396","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6896105,0.0014153445,0.29369938,0.0036514152,0.005464817,0.00018689681,0.0000019448273,0.000051642633,0.0059180586],"genre_scores_gemma":[0.98968416,0.00015075225,0.006228959,0.00036632604,0.003504499,3.415871e-7,0.0000017208054,0.000007022083,0.000056210134],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850434,0.000087234985,0.0004207556,0.00026878266,0.00051928574,0.0001995856],"domain_scores_gemma":[0.99880564,0.000590622,0.0003365095,0.00010261292,0.000099290926,0.00006532107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005288605,0.00014555083,0.00021465463,0.00020811927,0.00007697126,0.00022756681,0.0005003799,0.00004701336,0.0000032999465],"category_scores_gemma":[0.00002052769,0.00012694289,0.000052974305,0.0001510358,0.000029939372,0.00009373971,0.00028821052,0.00033047076,0.000004326543],"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.000055460445,0.000048250164,0.001140542,0.000004428147,0.000027281852,0.000029116587,0.00035976202,0.7740425,4.916403e-7,0.004515866,0.0004086139,0.21936767],"study_design_scores_gemma":[0.00094753294,0.00014409746,0.004082897,0.00075047027,0.000003134831,0.00006495368,0.00009313267,0.9720987,6.4234666e-7,0.006611687,0.0150644155,0.00013834785],"about_ca_topic_score_codex":0.0000024038707,"about_ca_topic_score_gemma":0.0000012738467,"teacher_disagreement_score":0.30007365,"about_ca_system_score_codex":0.0000773443,"about_ca_system_score_gemma":0.000020500955,"threshold_uncertainty_score":0.5176581},"labels":[],"label_agreement":null},{"id":"W4235539439","doi":"10.15803/ijnc.6.2_149","title":"A Practical Algorithm for Embedding Graphs on Torus","year":2016,"lang":"en","type":"article","venue":"International Journal of Networking and Computing","topic":"Advanced Graph Theory 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":"Simon Fraser University","funders":"","keywords":"Torus; Embedding; Computer science; Time complexity; Implementation; Exponential function; Graph embedding; Algorithm; Graph; Theoretical computer science; Exponential growth; Mathematics; Artificial intelligence","score_opus":0.04362782216819385,"score_gpt":0.382500242558034,"score_spread":0.33887242038984017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235539439","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.009010569,0.00009849778,0.9867558,0.002333516,0.001622396,0.000045826102,7.950592e-7,0.000020882355,0.00011175001],"genre_scores_gemma":[0.66712475,0.00006326085,0.33153266,0.00017429804,0.0010743077,8.433118e-7,1.2309363e-7,0.000007216801,0.000022569202],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883074,0.000080469676,0.00028777026,0.00016816547,0.00041777705,0.00021506115],"domain_scores_gemma":[0.9969537,0.0022304514,0.00027872063,0.00009295668,0.0003577742,0.00008634694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010178254,0.00008559812,0.00012739869,0.00019225606,0.00010216709,0.00014819592,0.0005140791,0.000033977234,0.000001262466],"category_scores_gemma":[0.00020536305,0.00005819225,0.000090438225,0.000099451645,0.0000427113,0.00030466146,0.00017141932,0.00016520625,0.0000010775872],"study_design_candidate":"design_other","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.00004171742,0.000027898282,0.00022016214,9.531138e-7,0.000080323436,0.00005966715,0.00008426987,0.00025685347,0.00017535097,0.05407408,0.00032477468,0.9446539],"study_design_scores_gemma":[0.0023280068,0.0007595435,0.00055873283,0.0010077454,0.000013379357,0.0015740639,0.00006138621,0.75866324,0.0005470238,0.21776201,0.016442968,0.00028190136],"about_ca_topic_score_codex":3.8075805e-7,"about_ca_topic_score_gemma":1.1772004e-7,"teacher_disagreement_score":0.94437206,"about_ca_system_score_codex":0.000056001038,"about_ca_system_score_gemma":0.000042852724,"threshold_uncertainty_score":0.23730111},"labels":[],"label_agreement":null},{"id":"W4315432722","doi":"10.15803/ijnc.13.1_18","title":"Dynamic Line Maintenance by Hybrid Programmable Matter","year":2023,"lang":"en","type":"article","venue":"International Journal of Networking and Computing","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Line (geometry)","score_opus":0.008137259009869035,"score_gpt":0.23817087044094115,"score_spread":0.23003361143107212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315432722","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6209056,0.0019979062,0.37179855,0.00070291315,0.00381092,0.000054781267,0.0000035560083,0.00013402359,0.0005917587],"genre_scores_gemma":[0.99717736,0.00054929324,0.0015562314,0.00008624769,0.00043910783,4.2426433e-7,0.000005445031,0.000017104918,0.00016878806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992396,0.000013355616,0.00029389255,0.00007818604,0.00019167547,0.0001832917],"domain_scores_gemma":[0.99965227,0.00006811003,0.00009158532,0.00004577885,0.000096190975,0.00004605079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000296041,0.00008536499,0.00011814566,0.00008423596,0.000038690334,0.000099606754,0.0002017945,0.000022670596,0.000010377259],"category_scores_gemma":[0.000009102706,0.00007640612,0.000046166486,0.000086674016,0.000017962908,0.000065097905,0.000049520873,0.00019594113,0.000015824719],"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.000013855625,0.000014539848,0.0028332372,0.000020269063,0.00016708895,0.00017684884,0.00017954805,0.5145712,0.00077995134,0.000040178078,0.023787083,0.4574162],"study_design_scores_gemma":[0.00015206488,0.00002426157,0.0006043797,0.00026032023,0.000005947231,0.0003370889,0.000029266805,0.9741037,0.00016889734,0.00050295016,0.02370781,0.00010335327],"about_ca_topic_score_codex":0.0000029066696,"about_ca_topic_score_gemma":5.9218877e-7,"teacher_disagreement_score":0.45953247,"about_ca_system_score_codex":0.000036850324,"about_ca_system_score_gemma":0.0000057555358,"threshold_uncertainty_score":0.3115751},"labels":[],"label_agreement":null},{"id":"W4412965319","doi":"10.15803/ijnc.15.2_199","title":"Asynchronous Separation of Unconscious Colored Robots","year":2025,"lang":"en","type":"article","venue":"International Journal of Networking and Computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"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; University of Ottawa","funders":"","keywords":"Computer science; Colored; Asynchronous communication; Unconscious mind; Separation (statistics); Robot; Artificial intelligence; Machine learning; Computer network; Psychology","score_opus":0.010477545434982735,"score_gpt":0.3124047701585097,"score_spread":0.30192722472352695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412965319","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.02932284,0.0005483396,0.966029,0.0010896394,0.0015374343,0.00003934215,1.8418376e-7,0.000015005624,0.0014182504],"genre_scores_gemma":[0.95280993,0.000094759904,0.046686262,0.0001821371,0.00019615867,2.0164649e-7,5.7807875e-7,0.0000020555965,0.00002789397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908555,0.000074927426,0.00040597824,0.00009269368,0.0002461059,0.000094749244],"domain_scores_gemma":[0.99882793,0.0002474275,0.00034271268,0.00006557649,0.00048327996,0.000033064985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057020434,0.00005798618,0.00013619459,0.00019336445,0.00006102001,0.00012985663,0.00043485436,0.000033264663,0.0000015841221],"category_scores_gemma":[0.000050952087,0.000053553067,0.000046470737,0.00018871625,0.00003173648,0.00016370333,0.00015668836,0.0001274814,3.5670854e-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.000041885196,0.00008714647,0.008658541,0.000015516096,0.00022687811,0.00003029985,0.0010481181,0.54435885,0.00051752734,0.03475886,0.0010455472,0.40921083],"study_design_scores_gemma":[0.0006292355,0.00009000049,0.0024535207,0.00032779848,0.0000069419766,0.000083646,0.000036586203,0.9893035,0.0002180608,0.0052863127,0.0014998565,0.0000645336],"about_ca_topic_score_codex":0.0000046632563,"about_ca_topic_score_gemma":0.000002375192,"teacher_disagreement_score":0.9234871,"about_ca_system_score_codex":0.000043298583,"about_ca_system_score_gemma":0.00012384106,"threshold_uncertainty_score":0.21838307},"labels":[],"label_agreement":null}]}