{"meta":{"query_hash":"e7aa0bc94077","filters":{"venue":"IASTED PDCS"},"cohort_total":5,"direct_labels_cover":0,"predictions_cover":5,"exported":5,"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/e7aa0bc94077","api":"https://metacan.xera.ac/api/v1/cohort?venue=IASTED+PDCS"},"results":[{"id":"W113335647","doi":"","title":"A Lazy Replication Scheme for Loosely Synchronized UDDI Registries.","year":2005,"lang":"en","type":"article","venue":"IASTED PDCS","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Session (web analytics); Scalability; Replication (statistics); Scheme (mathematics); Failover; Web service; High availability; Distributed computing; Computer network; Database; World Wide Web","score_opus":0.020597982225951928,"score_gpt":0.2746282626516152,"score_spread":0.2540302804256633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W113335647","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.007652838,0.00059449,0.9833712,0.0042013945,0.00028059407,0.00057829195,0.00006017992,0.00038056922,0.0028804245],"genre_scores_gemma":[0.8791324,0.000021483818,0.11311755,0.000748996,0.00049821945,0.0002617104,0.00009282865,0.000024250981,0.0061025596],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984602,0.000031883937,0.00036645346,0.00057178276,0.00023307912,0.00033661845],"domain_scores_gemma":[0.9980927,0.00007464754,0.00019871094,0.0013005235,0.00022847154,0.00010494384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003815381,0.00015432923,0.00021632962,0.000051244613,0.00014534545,0.00018452028,0.00073942327,0.00010899835,0.000012032815],"category_scores_gemma":[0.00015265735,0.00014889833,0.00009164509,0.0004215301,0.000035893703,0.00045452736,0.000080066464,0.000099143115,0.00012890389],"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.000080830214,0.0002989458,0.00022033074,0.00014941007,0.0000930393,0.000009739101,0.0012818559,0.0003971894,0.006992512,0.17070739,0.21978493,0.5999838],"study_design_scores_gemma":[0.0012027789,0.00006422108,0.0003483521,0.000058133686,0.000006333248,0.000026636884,0.00002682544,0.14079948,0.002478495,0.00027015412,0.8544801,0.00023851037],"about_ca_topic_score_codex":0.000019670713,"about_ca_topic_score_gemma":0.000017260316,"teacher_disagreement_score":0.8714796,"about_ca_system_score_codex":0.00009500756,"about_ca_system_score_gemma":0.00011256968,"threshold_uncertainty_score":0.6071898},"labels":[],"label_agreement":null},{"id":"W146732267","doi":"","title":"Clustering using an Autoassociator: A Case Study in Network Event Correlation.","year":2005,"lang":"en","type":"article","venue":"IASTED PDCS","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":6,"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 Ottawa","funders":"","keywords":"Cluster analysis; Computer science; Novelty; Artificial intelligence; Data mining; Artificial neural network; Event (particle physics); Feedforward neural network; Feature (linguistics); Task (project management); Correlation clustering; Correlation; Machine learning; Pattern recognition (psychology); Mathematics; Engineering","score_opus":0.03270833436532282,"score_gpt":0.2903363437473334,"score_spread":0.2576280093820106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W146732267","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.72915596,0.000054960652,0.2697231,0.00004637291,0.0005959572,0.00022316458,3.0030427e-7,0.0001178298,0.00008236298],"genre_scores_gemma":[0.98663396,0.0000022813274,0.012746944,0.0001461364,0.0004237104,0.000008276366,6.605507e-7,0.00000918052,0.000028830733],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986115,0.00024697246,0.00032508923,0.00030663252,0.00021334409,0.00029644882],"domain_scores_gemma":[0.9993691,0.000054762702,0.00011854531,0.0003321294,0.00004251158,0.000082972234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000589759,0.00011796105,0.00014341182,0.00010582662,0.00024128407,0.00012545753,0.0002367336,0.00008481311,0.00002106519],"category_scores_gemma":[0.000014765404,0.00012781573,0.000035141584,0.0006698772,0.000009576171,0.00077409076,0.0001832914,0.00024204896,0.000018430264],"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.000008849881,0.00039029872,0.0055451225,0.0000027508613,0.000012594904,0.00046148628,0.010822414,0.9040783,0.000013992816,0.00013441898,0.00010353222,0.07842622],"study_design_scores_gemma":[0.00047458077,0.00014106047,0.002723542,0.000024124409,0.000006203783,0.0005186262,0.00056862517,0.9947687,0.000005530104,0.000082617924,0.00054028863,0.00014611254],"about_ca_topic_score_codex":0.00043268382,"about_ca_topic_score_gemma":0.0062788213,"teacher_disagreement_score":0.25747803,"about_ca_system_score_codex":0.00021081947,"about_ca_system_score_gemma":0.000042655407,"threshold_uncertainty_score":0.52121747},"labels":[],"label_agreement":null},{"id":"W157886190","doi":"","title":"Communication Characteristics of Message-Passing Scientific and Engineering Applications.","year":2005,"lang":"en","type":"article","venue":"IASTED PDCS","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Message passing; Computer science; Suite; Benchmark (surveying); Payload (computing); Distributed computing; Point-to-point; Message broker; Message Passing Interface; Communications system; Computer network","score_opus":0.011606274004377805,"score_gpt":0.2386618171016495,"score_spread":0.2270555430972717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W157886190","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.018635739,0.00025046966,0.9800257,0.00036280716,0.000029050416,0.000096779055,0.000001437165,0.00023036254,0.00036764605],"genre_scores_gemma":[0.6471707,0.000023119337,0.35269424,0.000035987676,0.000012635807,0.000008275567,0.0000055258297,0.0000035668063,0.000045914898],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944663,0.000024030875,0.00018866503,0.00014802047,0.000102205784,0.0000904429],"domain_scores_gemma":[0.99926287,0.000057494402,0.0001070868,0.00043817013,0.000100785,0.00003357665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023997451,0.000060961804,0.0000890785,0.00011115971,0.00012410697,0.00014484914,0.0003659443,0.000034216442,0.0000018037971],"category_scores_gemma":[0.000022116663,0.00006523413,0.0000147749815,0.00030456626,0.00004833047,0.00021172382,0.0001496283,0.000068488596,0.0000028768418],"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.000005088258,0.0002790915,0.0014827178,0.0001630886,0.000039513856,0.0000010048551,0.0040107584,0.015185089,0.017782979,0.11245765,0.0024174696,0.84617555],"study_design_scores_gemma":[0.00013957315,0.000012858479,0.005971448,0.00007112978,0.000005770652,0.000008502266,0.000009905429,0.9585119,0.007208934,0.00025640274,0.027648037,0.00015553602],"about_ca_topic_score_codex":0.0000021952128,"about_ca_topic_score_gemma":4.869654e-7,"teacher_disagreement_score":0.94332683,"about_ca_system_score_codex":0.000014995231,"about_ca_system_score_gemma":0.000018759907,"threshold_uncertainty_score":0.26601708},"labels":[],"label_agreement":null},{"id":"W2400277655","doi":"","title":"Dynamic Multi-Resource Monitoring for Predictive Job Scheduling with ScoPro.","year":2005,"lang":"en","type":"article","venue":"IASTED PDCS","topic":"Distributed and Parallel Computing 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":"University of Windsor","funders":"","keywords":"Computer science; Workload; Distributed computing; Job scheduler; Scheduling (production processes); Grid; Intrusion detection system; Shared resource; Job queue; Real-time computing; Resource (disambiguation); Grid computing; Data mining; Cloud computing; Operating system; Computer network; Engineering; Operations management","score_opus":0.019365039111041826,"score_gpt":0.267704726324828,"score_spread":0.2483396872137862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400277655","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.13007249,0.0002458554,0.8679707,0.0002058622,0.00031659636,0.00040346716,0.000013484896,0.00040094362,0.00037061807],"genre_scores_gemma":[0.7653486,0.0000011977445,0.23397823,0.00003360306,0.00021641805,0.000039751056,0.000007874481,0.000017653445,0.00035668624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847907,0.00005007738,0.00026387733,0.00047885792,0.0002737225,0.00045440282],"domain_scores_gemma":[0.99898905,0.00013149832,0.00013919451,0.00045827817,0.00015249597,0.00012946066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027338124,0.00020721875,0.00021485786,0.00009234851,0.00023050969,0.00021706555,0.00073172996,0.00008850779,0.0000010345183],"category_scores_gemma":[0.00003718725,0.00017969534,0.000066766115,0.00035350403,0.000033499127,0.000313018,0.00012299704,0.00017890458,0.000031450574],"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.00009525429,0.00021005241,0.0070861927,0.0001398124,0.00018998736,0.000018893334,0.0056362795,0.94063103,0.00084536854,0.0010276202,0.00030613103,0.043813396],"study_design_scores_gemma":[0.0011638053,0.00017739595,0.0032170955,0.00031119562,0.000013117968,0.000030712872,0.00020486786,0.99047863,0.0004124861,0.000020185344,0.0037160213,0.00025447248],"about_ca_topic_score_codex":0.000012932443,"about_ca_topic_score_gemma":0.000009826361,"teacher_disagreement_score":0.6352761,"about_ca_system_score_codex":0.00010131458,"about_ca_system_score_gemma":0.00008061828,"threshold_uncertainty_score":0.73277634},"labels":[],"label_agreement":null},{"id":"W65480259","doi":"","title":"The BNAI Analyzer: A Tool for Verifying Admissible Information Flow in Protocols.","year":2002,"lang":"en","type":"article","venue":"IASTED PDCS","topic":"Physical Unclonable Functions (PUFs) and Hardware Security","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Property (philosophy); Protocol (science); Information flow; Bisimulation; State (computer science); Cryptographic protocol; Theoretical computer science; Finite-state machine; Confidentiality; Distributed computing; Programming language; Algorithm; Computer security; Cryptography","score_opus":0.025942878433576667,"score_gpt":0.25591780839669853,"score_spread":0.22997492996312185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W65480259","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.014094539,0.00014738887,0.94606507,0.0051092873,0.0009098933,0.020644302,0.000046346722,0.0006580979,0.012325051],"genre_scores_gemma":[0.9319169,0.000040784293,0.040037785,0.0021054833,0.0005172097,0.023818368,0.00004230821,0.0000317707,0.0014893983],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897206,0.000042698637,0.00027900067,0.0001715019,0.0002235383,0.00031117548],"domain_scores_gemma":[0.9991448,0.0001475767,0.00008348971,0.00043686957,0.0001217605,0.000065532564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002587831,0.000113087,0.00012628168,0.00009873871,0.0003111009,0.00035647096,0.0005125074,0.000057665453,0.000024558538],"category_scores_gemma":[0.00018450896,0.00008496179,0.00007856062,0.0007394552,0.0000227406,0.0013814309,0.00010393929,0.00016198757,0.00010450061],"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.0000923899,0.000359884,0.00049016904,0.00017459986,0.00004483317,0.0000051543293,0.0047076466,0.0031003873,0.00011151117,0.053497642,0.03662116,0.9007946],"study_design_scores_gemma":[0.0006610578,0.00010263782,0.0011851123,0.000041689134,0.000003412941,0.0000025928757,0.00003444808,0.63692045,0.0002155524,0.0028835665,0.3578075,0.00014201376],"about_ca_topic_score_codex":0.000014230801,"about_ca_topic_score_gemma":0.000032427786,"teacher_disagreement_score":0.91782236,"about_ca_system_score_codex":0.00006291981,"about_ca_system_score_gemma":0.000054995744,"threshold_uncertainty_score":0.34646413},"labels":[],"label_agreement":null}]}