{"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14662726,0.000114352086,0.8384718,0.0007356453,0.00005347265,0.00053896895,0.00027794912,0.009008215,0.0041723815],"genre_scores_gemma":[0.691721,0.00012534313,0.3034783,0.00021336884,0.000056381712,0.00030389617,0.00089828455,0.0003029482,0.0029004158],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99592906,0.0010539896,0.00046026125,0.00073353155,0.0015256426,0.00029746786],"domain_scores_gemma":[0.9957087,0.0015837484,0.00026597158,0.0013055612,0.00075766526,0.00037832733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006425852,0.00047926544,0.0011554247,0.00096298795,0.0021633182,0.003077976,0.0029417523,0.0012643178,0.0019283309],"category_scores_gemma":[0.005671363,0.0005875052,0.00061634125,0.0014021305,0.0011138757,0.0054441835,0.0029981278,0.0010227165,0.0007012195],"study_design_candidate":"not_applicable","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.0028993464,0.0026248125,0.011082376,0.0004506967,0.0004165722,0.0028007654,0.003073608,0.4641165,0.125045,0.106208846,0.016897302,0.26438412],"study_design_scores_gemma":[0.00016164694,0.00010086698,0.00043805884,0.000008582609,0.000041686704,0.00013718406,0.0003661908,0.956363,0.019386688,0.018338287,0.004618822,0.000038906306],"about_ca_topic_score_codex":0.0049939468,"about_ca_topic_score_gemma":0.0042146454,"teacher_disagreement_score":0.006425852,"about_ca_system_score_codex":0.0014112559,"about_ca_system_score_gemma":0.0029708263,"threshold_uncertainty_score":0.03398359},"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":"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.0038990376,0.00006877634,0.99424994,0.00022438438,0.000019742556,0.00009593639,0.00006684377,0.0005267397,0.00084864045],"genre_scores_gemma":[0.09458923,0.0002548824,0.9018397,0.00020496966,0.00006278227,0.00020632605,0.00032435352,0.0002875299,0.0022302645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935603,0.0017240847,0.00074982515,0.0012079444,0.0022331835,0.00052461703],"domain_scores_gemma":[0.9919186,0.004608349,0.0005408736,0.0018073345,0.0008025461,0.00032233496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008697223,0.00077377487,0.0010279705,0.0012621417,0.002342847,0.0049111326,0.0030127643,0.0013045905,0.0038574445],"category_scores_gemma":[0.009151916,0.0011662968,0.0038748113,0.0011917095,0.0041934256,0.00924741,0.005015652,0.003726652,0.0006132196],"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.0003093486,0.00023461864,0.0017285444,0.0005802167,0.00024574506,0.0007847503,0.001983782,0.11740079,0.010443887,0.7619729,0.002691149,0.101624176],"study_design_scores_gemma":[0.00009862189,0.00005830334,0.00011084117,0.00006994486,0.00013748374,0.00023177736,0.0002041804,0.33406976,0.014025398,0.6290043,0.021927949,0.00006140098],"about_ca_topic_score_codex":0.00667473,"about_ca_topic_score_gemma":0.008336741,"teacher_disagreement_score":0.008697223,"about_ca_system_score_codex":0.002630629,"about_ca_system_score_gemma":0.004286673,"threshold_uncertainty_score":0.04599589},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36019176,0.009766054,0.26418483,0.040093426,0.007651594,0.0007394888,0.0016189201,0.012722343,0.30303162],"genre_scores_gemma":[0.84930426,0.0018576318,0.048780154,0.004180898,0.0004793265,0.00022500273,0.0008335378,0.001559749,0.09277948],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984843,0.00036136998,0.00007796162,0.00020556299,0.00049287453,0.00037789586],"domain_scores_gemma":[0.9889008,0.005049813,0.0004297254,0.0033232996,0.0014475652,0.0008488487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014660457,0.0011503465,0.0011695671,0.0008884379,0.0017681429,0.002731714,0.002242119,0.0022282011,0.07681492],"category_scores_gemma":[0.01690529,0.0005945117,0.00083199976,0.0010536164,0.0012015925,0.0071756584,0.002945639,0.0027206244,0.013975653],"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.0028032074,0.0006231483,0.005039897,0.000772821,0.00018266069,0.0015964322,0.00073258724,0.050098695,0.036072336,0.14807005,0.09458448,0.65942365],"study_design_scores_gemma":[0.0004999632,0.0024396533,0.014587495,0.00075357815,0.0008873129,0.007093648,0.0053682076,0.3040768,0.034613412,0.3394076,0.2898907,0.00038171207],"about_ca_topic_score_codex":0.0027604604,"about_ca_topic_score_gemma":0.00330817,"teacher_disagreement_score":0.07681492,"about_ca_system_score_codex":0.0008722624,"about_ca_system_score_gemma":0.0013496039,"threshold_uncertainty_score":0.25697148},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00089425716,0.016308032,0.0076129353,0.03230775,0.8977754,0.00028814524,0.0012440303,0.0005590845,0.04301041],"genre_scores_gemma":[0.0073433877,0.02705979,0.0059367134,0.008156325,0.70940536,0.00038483366,0.0046681087,0.0016122176,0.23543325],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974534,0.00036228469,0.0002458683,0.00044832667,0.0012505337,0.00023951699],"domain_scores_gemma":[0.98781556,0.0020650527,0.00057920534,0.0007725209,0.0059793647,0.0027882657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003923105,0.0018273714,0.0017194214,0.0036926337,0.0020172813,0.0067431945,0.0022213366,0.0029317986,0.13405561],"category_scores_gemma":[0.01047588,0.0005936142,0.0016839291,0.0018830039,0.0008406935,0.00504111,0.0029442583,0.0061066193,0.07659683],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000036149253,0.000033386776,0.00007732069,0.00024179097,0.000009481777,0.000052117808,0.00004269289,0.00011535515,0.0002888678,0.0020603891,0.97188187,0.025160639],"study_design_scores_gemma":[0.000009068633,0.00004383078,0.00027226665,0.0002622326,0.000011469742,0.0001252617,0.000050409915,0.0003590138,0.00019706546,0.0029539992,0.9957027,0.0000126747855],"about_ca_topic_score_codex":0.00083184283,"about_ca_topic_score_gemma":0.0013754121,"teacher_disagreement_score":0.13405561,"about_ca_system_score_codex":0.002165633,"about_ca_system_score_gemma":0.0030884643,"threshold_uncertainty_score":0.4484607},"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":"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.01719128,0.00019763701,0.9661648,0.0006110665,0.00020616112,0.00022048023,0.00029841333,0.0063941944,0.00871596],"genre_scores_gemma":[0.158306,0.00032766224,0.8279419,0.00023674496,0.00010014036,0.00035599383,0.0022091663,0.00066401775,0.009858336],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989373,0.000100417135,0.00008967986,0.00031611774,0.0003348614,0.00022157274],"domain_scores_gemma":[0.9989023,0.00023327235,0.00008033649,0.00037242615,0.00032831202,0.00008328981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004284046,0.0012392527,0.0006743756,0.0009859509,0.0010500356,0.0009639532,0.0013799387,0.0011327114,0.011147131],"category_scores_gemma":[0.0025930356,0.00045677266,0.0008435594,0.0016623029,0.00066721305,0.0032334693,0.0026450737,0.0012507073,0.0039016528],"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.00047643998,0.0003987557,0.0012818581,0.0005462174,0.000080791855,0.0006315474,0.0005738348,0.06878576,0.0389308,0.0688847,0.072312094,0.74709725],"study_design_scores_gemma":[0.00035662478,0.0004768871,0.0008881839,0.000053312513,0.000115344395,0.0020010457,0.00073486095,0.67398936,0.034764726,0.18451709,0.10197386,0.0001287511],"about_ca_topic_score_codex":0.0020734228,"about_ca_topic_score_gemma":0.0027911644,"teacher_disagreement_score":0.011147131,"about_ca_system_score_codex":0.000822574,"about_ca_system_score_gemma":0.0016998783,"threshold_uncertainty_score":0.03729093},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5034245,0.0007554389,0.4800944,0.00044015175,0.00020257264,0.00006277227,0.00007117916,0.0015537577,0.013395117],"genre_scores_gemma":[0.97804755,0.00010965693,0.018703762,0.000068756235,0.000020027914,0.000049959915,0.00003586938,0.000046213565,0.0029182036],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982077,0.000032829517,0.000008557584,0.00006552895,0.000040689327,0.00003162147],"domain_scores_gemma":[0.9995253,0.00017308003,0.00010461246,0.0001015184,0.00004211998,0.000053394193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025266616,0.0002384744,0.00039433702,0.00044985308,0.0005708539,0.0007748068,0.00083091203,0.00066891016,0.002156003],"category_scores_gemma":[0.00078918395,0.00022971578,0.00033897732,0.000266502,0.0010811759,0.0010008286,0.0011683294,0.0003772162,0.0003074026],"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.0005884098,0.00017565415,0.0020023445,0.00027251185,0.000095195566,0.0011497411,0.0005459007,0.5023023,0.15862855,0.26307273,0.0034563623,0.06771038],"study_design_scores_gemma":[0.00005260096,0.00015663332,0.0003025738,0.000011103231,0.000014692792,0.00019248488,0.000065779364,0.92223775,0.016006611,0.057219762,0.0037116995,0.000028350123],"about_ca_topic_score_codex":0.00048750432,"about_ca_topic_score_gemma":0.00034362433,"teacher_disagreement_score":0.002156003,"about_ca_system_score_codex":0.00047201838,"about_ca_system_score_gemma":0.00017952832,"threshold_uncertainty_score":0.0072125196},"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":"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.063939944,0.00010413608,0.9277775,0.00044378906,0.00009724098,0.00007141711,0.0000700905,0.00023761249,0.0072582955],"genre_scores_gemma":[0.86947477,0.00015396286,0.11905835,0.0001885644,0.00008407657,0.00013636502,0.00010224027,0.000071873714,0.010729745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867505,0.00039109026,0.00004745427,0.00035778264,0.00026988634,0.00025870302],"domain_scores_gemma":[0.997889,0.00074651046,0.0003233539,0.0005410538,0.00023715784,0.00026289112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096649874,0.00074888277,0.00068292517,0.00027165172,0.0009145466,0.0014004096,0.002069363,0.00086881756,0.0036298023],"category_scores_gemma":[0.003009967,0.00034937297,0.00067301316,0.00048180882,0.0019329304,0.0030578761,0.002872782,0.0018670034,0.0005604166],"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.0005578873,0.00012366069,0.00091133465,0.000106706626,0.00004481829,0.0005830651,0.00050755934,0.3632957,0.011677981,0.6043306,0.001811849,0.016048843],"study_design_scores_gemma":[0.00009038052,0.00010710203,0.00012386832,0.000006763422,0.000018350258,0.00007531042,0.000072823845,0.859959,0.0031770936,0.13265763,0.0036913182,0.000020321415],"about_ca_topic_score_codex":0.0017686657,"about_ca_topic_score_gemma":0.0016176284,"teacher_disagreement_score":0.0036298023,"about_ca_system_score_codex":0.0011143761,"about_ca_system_score_gemma":0.0012255424,"threshold_uncertainty_score":0.012142897},"labels":[],"label_agreement":null}]}