{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":5,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":5,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"e7aa0bc94077","filters":{"venue":"IASTED PDCS"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Reza Zamani","is_ca":false},{"name":"Ahmad Afsahi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01160627400437781,"gpt":0.2386618171016495,"spread":0.2270555430972717,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001188338,0.0004950466,0.0003486336,0.0009582379,0.0005717411,0.0008491304,0.0004741839,0.0005384594,0.001218801],"category_scores_gemma":[0.01231652,0.000210677,0.0002118696,0.001545391,0.0003395717,0.001315951,0.0004953688,0.0004701647,0.0004240792],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004669754,"about_ca_system_score_gemma":0.0005992017,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001122389,"about_ca_topic_score_gemma":0.001051305,"domain_scores_codex":[0.9980958,0.0004132752,0.0001161073,0.0001956791,0.001016532,0.0001625548],"domain_scores_gemma":[0.9891165,0.006232403,0.001879751,0.0006762581,0.001855857,0.0002392166],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","study_design_scores_codex":[0.001275836,0.0004102117,0.2253391,0.001511395,0.0002277423,0.001255392,0.002086331,0.2915606,0.2241726,0.01843918,0.007911817,0.2258097],"study_design_scores_gemma":[0.00006783249,0.0009458639,0.1593197,0.00009920091,0.0002040577,0.003708077,0.001343718,0.6119921,0.1658044,0.01602041,0.04034325,0.0001513407],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8858868,0.001461343,0.09994699,0.0004963432,0.00008152029,0.0001780059,0.0007304126,0.001121456,0.01009722],"genre_scores_gemma":[0.9816807,0.0003558435,0.01506461,0.00003836683,0.00004959675,0.0001141024,0.0007945643,0.0001622174,0.0017399],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001218801,"threshold_uncertainty_score":0.006284595,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Reuben Smith","is_ca":true},{"name":"Nathalie Japkowicz","is_ca":false},{"name":"Maxwell G. Dondo","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03270833436532282,"gpt":0.2903363437473334,"spread":0.2576280093820106,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003162557,0.0005563677,0.0007671688,0.001383858,0.001278433,0.001247497,0.001320877,0.00219224,0.00113064],"category_scores_gemma":[0.01059067,0.0002977889,0.0006751148,0.002905981,0.001007639,0.00179303,0.001069151,0.001123977,0.0003609379],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008437447,"about_ca_system_score_gemma":0.0005815485,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00406285,"about_ca_topic_score_gemma":0.00609549,"domain_scores_codex":[0.9979628,0.0009105012,0.00009780538,0.0003174236,0.0005634181,0.0001480902],"domain_scores_gemma":[0.9919668,0.005192143,0.0005312008,0.001003197,0.001043607,0.0002630342],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001729056,0.001134966,0.07896905,0.001232577,0.0006642591,0.01587867,0.004892854,0.3806051,0.02862405,0.04227133,0.0147799,0.4292182],"study_design_scores_gemma":[0.0001030693,0.000564763,0.0211677,0.00006975896,0.000152972,0.007546625,0.001474643,0.8864442,0.03644807,0.02483694,0.02106528,0.0001260833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6063398,0.001370229,0.3802459,0.001680168,0.0001343244,0.0003049125,0.0004532675,0.001394664,0.008076681],"genre_scores_gemma":[0.8738616,0.0004977529,0.1223656,0.0001741023,0.00006434858,0.00009527016,0.0003079501,0.0001104768,0.002522804],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00406285,"threshold_uncertainty_score":0.01672542,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Mahantesh Surgihalli","is_ca":false},{"name":"K. Vidyasankar","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02059798222595193,"gpt":0.2746282626516152,"spread":0.2540302804256633,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005748049,0.000541025,0.0008204217,0.001239206,0.002783664,0.002829368,0.00372329,0.001241708,0.003309251],"category_scores_gemma":[0.01141185,0.0006617347,0.0007506029,0.001440441,0.00121765,0.004376316,0.005565663,0.001795916,0.002100469],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001735486,"about_ca_system_score_gemma":0.003482792,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002519237,"about_ca_topic_score_gemma":0.002746163,"domain_scores_codex":[0.9954097,0.001421789,0.0006948963,0.0007531889,0.001400283,0.0003201836],"domain_scores_gemma":[0.9920207,0.0008617488,0.0007362385,0.004747103,0.001204185,0.0004299767],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000928047,0.000256828,0.003124091,0.0005257987,0.0002231959,0.0004831295,0.001627953,0.04922451,0.03606284,0.3731176,0.04049843,0.4939274],"study_design_scores_gemma":[0.0005304132,0.0005969056,0.0008703685,0.0001360244,0.0002304131,0.001372069,0.0004089008,0.579999,0.03761575,0.135782,0.2421365,0.0003215901],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003790443,0.0002690674,0.9905806,0.0002242644,0.0001918926,0.0003100068,0.00009418468,0.002766554,0.001773002],"genre_scores_gemma":[0.1810704,0.000396216,0.8065478,0.0002763254,0.0001862909,0.00059321,0.0006816635,0.0004448075,0.009803265],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005748049,"threshold_uncertainty_score":0.03039896,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Gaétan Hains","is_ca":false},{"name":"Matthieu Bergeron","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02594287843357667,"gpt":0.2559178083966985,"spread":0.2299749299631219,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004563648,0.001809305,0.0009526631,0.002309063,0.0008464045,0.00223652,0.002362601,0.001579633,0.007114305],"category_scores_gemma":[0.01990347,0.001073353,0.001017301,0.0009387647,0.002427147,0.00410305,0.00281657,0.003037766,0.003089044],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007736374,"about_ca_system_score_gemma":0.002414161,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001363876,"about_ca_topic_score_gemma":0.0007326514,"domain_scores_codex":[0.9948631,0.001484815,0.0004604347,0.0006593486,0.0022167,0.0003156173],"domain_scores_gemma":[0.9877509,0.007357202,0.00118071,0.002435597,0.001051743,0.0002238753],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001164287,0.0004328241,0.006352901,0.002014787,0.0003211326,0.002057213,0.001727101,0.06205074,0.1323921,0.411149,0.02011317,0.3602248],"study_design_scores_gemma":[0.0001645875,0.0003976887,0.001360885,0.0003530147,0.0001326517,0.002206943,0.00019491,0.5245518,0.1958088,0.1987119,0.07593895,0.0001778932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002802548,0.00006537158,0.9828743,0.00003828394,0.0000333239,0.0001039614,0.0001751878,0.0124282,0.001478868],"genre_scores_gemma":[0.1461636,0.0003179337,0.8452275,0.0001898038,0.00004791186,0.0008883789,0.001135913,0.002351663,0.003677356],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007114305,"threshold_uncertainty_score":0.02413517,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Angela C. Sodan","is_ca":true},{"name":"Lun Liu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01936503911104183,"gpt":0.267704726324828,"spread":0.2483396872137862,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001219769,0.0009200155,0.0006036441,0.001234155,0.0004445369,0.001055929,0.001417952,0.0005121688,0.00252229],"category_scores_gemma":[0.005379889,0.0005451509,0.000338568,0.0007867976,0.0006146163,0.001287853,0.001008158,0.0008367574,0.0008239222],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004476343,"about_ca_system_score_gemma":0.0009184574,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001582012,"about_ca_topic_score_gemma":0.002130664,"domain_scores_codex":[0.9989034,0.0002568146,0.00007299913,0.0002411816,0.0004272932,0.00009837712],"domain_scores_gemma":[0.996537,0.001254678,0.0004491942,0.001162125,0.0004190574,0.000177989],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.003530482,0.0006017565,0.03257794,0.0008321443,0.0002570353,0.001131367,0.0007779324,0.09708953,0.1934355,0.01505093,0.023325,0.6313905],"study_design_scores_gemma":[0.00007654456,0.0002382432,0.004542314,0.00005277418,0.00004929933,0.0005364115,0.00005538588,0.8919963,0.0802009,0.004105138,0.01806736,0.00007943117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04721807,0.0004091854,0.8902966,0.0002390067,0.000160835,0.0002748836,0.0006740295,0.05539194,0.005335405],"genre_scores_gemma":[0.6818634,0.0001852683,0.3121537,0.0002228132,0.00007342744,0.0002632868,0.0009898266,0.001326788,0.002921497],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00252229,"threshold_uncertainty_score":0.008437872,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}