{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002399745,0.0000609618,0.0000890785,0.0001111597,0.000124107,0.0001448491,0.0003659443,0.00003421644,0.000001803797],"category_scores_gemma":[0.00002211666,0.00006523413,0.00001477498,0.0003045663,0.00004833047,0.0002117238,0.0001496283,0.0000684886,0.000002876842],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001499523,"about_ca_system_score_gemma":0.00001875991,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002195213,"about_ca_topic_score_gemma":4.869654e-7,"domain_scores_codex":[0.9994466,0.00002403087,0.000188665,0.0001480205,0.0001022058,0.0000904429],"domain_scores_gemma":[0.9992629,0.0000574944,0.0001070868,0.0004381701,0.000100785,0.00003357665],"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.000005088258,0.0002790915,0.001482718,0.0001630886,0.00003951386,0.000001004855,0.004010758,0.01518509,0.01778298,0.1124576,0.00241747,0.8461756],"study_design_scores_gemma":[0.0001395732,0.00001285848,0.005971448,0.00007112978,0.000005770652,0.000008502266,0.000009905429,0.9585119,0.007208934,0.0002564027,0.02764804,0.000155536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01863574,0.0002504697,0.9800257,0.0003628072,0.00002905042,0.00009677905,0.000001437165,0.0002303625,0.000367646],"genre_scores_gemma":[0.6471707,0.00002311934,0.3526942,0.00003598768,0.00001263581,0.000008275567,0.00000552583,0.000003566806,0.0000459149],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9433268,"threshold_uncertainty_score":0.2660171,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000589759,0.000117961,0.0001434118,0.0001058266,0.0002412841,0.0001254575,0.0002367336,0.00008481311,0.00002106519],"category_scores_gemma":[0.0000147654,0.0001278157,0.00003514158,0.0006698772,0.000009576171,0.0007740908,0.0001832914,0.000242049,0.00001843026],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002108195,"about_ca_system_score_gemma":0.00004265541,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004326838,"about_ca_topic_score_gemma":0.006278821,"domain_scores_codex":[0.9986115,0.0002469725,0.0003250892,0.0003066325,0.0002133441,0.0002964488],"domain_scores_gemma":[0.9993691,0.0000547627,0.0001185453,0.0003321294,0.00004251158,0.00008297223],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008849881,0.0003902987,0.005545123,0.000002750861,0.0000125949,0.0004614863,0.01082241,0.9040783,0.00001399282,0.000134419,0.0001035322,0.07842622],"study_design_scores_gemma":[0.0004745808,0.0001410605,0.002723542,0.00002412441,0.000006203783,0.0005186262,0.0005686252,0.9947687,0.000005530104,0.00008261792,0.0005402886,0.0001461125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.729156,0.00005496065,0.2697231,0.00004637291,0.0005959572,0.0002231646,3.003043e-7,0.0001178298,0.00008236298],"genre_scores_gemma":[0.986634,0.000002281327,0.01274694,0.0001461364,0.0004237104,0.000008276366,6.605507e-7,0.00000918052,0.00002883073],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.257478,"threshold_uncertainty_score":0.5212175,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003815381,0.0001543292,0.0002163296,0.00005124461,0.0001453454,0.0001845203,0.0007394233,0.0001089983,0.00001203281],"category_scores_gemma":[0.0001526573,0.0001488983,0.00009164509,0.0004215301,0.0000358937,0.0004545274,0.00008006646,0.00009914312,0.0001289039],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009500756,"about_ca_system_score_gemma":0.0001125697,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001967071,"about_ca_topic_score_gemma":0.00001726032,"domain_scores_codex":[0.9984602,0.00003188394,0.0003664535,0.0005717828,0.0002330791,0.0003366185],"domain_scores_gemma":[0.9980927,0.00007464754,0.0001987109,0.001300524,0.0002284715,0.0001049438],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00008083021,0.0002989458,0.0002203307,0.0001494101,0.0000930393,0.000009739101,0.001281856,0.0003971894,0.006992512,0.1707074,0.2197849,0.5999838],"study_design_scores_gemma":[0.001202779,0.00006422108,0.0003483521,0.00005813369,0.000006333248,0.00002663688,0.00002682544,0.1407995,0.002478495,0.0002701541,0.8544801,0.0002385104],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007652838,0.00059449,0.9833712,0.004201395,0.0002805941,0.0005782919,0.00006017992,0.0003805692,0.002880424],"genre_scores_gemma":[0.8791324,0.00002148382,0.1131176,0.000748996,0.0004982195,0.0002617104,0.00009282865,0.00002425098,0.00610256],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8714796,"threshold_uncertainty_score":0.6071898,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002587831,0.000113087,0.0001262817,0.00009873871,0.0003111009,0.000356471,0.0005125074,0.00005766545,0.00002455854],"category_scores_gemma":[0.000184509,0.00008496179,0.00007856062,0.0007394552,0.0000227406,0.001381431,0.0001039393,0.0001619876,0.0001045006],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006291981,"about_ca_system_score_gemma":0.00005499574,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000142308,"about_ca_topic_score_gemma":0.00003242779,"domain_scores_codex":[0.9989721,0.00004269864,0.0002790007,0.0001715019,0.0002235383,0.0003111755],"domain_scores_gemma":[0.9991448,0.0001475767,0.00008348971,0.0004368696,0.0001217605,0.00006553256],"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.0000923899,0.000359884,0.000490169,0.0001745999,0.00004483317,0.000005154329,0.004707647,0.003100387,0.0001115112,0.05349764,0.03662116,0.9007946],"study_design_scores_gemma":[0.0006610578,0.0001026378,0.001185112,0.00004168913,0.000003412941,0.000002592876,0.00003444808,0.6369205,0.0002155524,0.002883567,0.3578075,0.0001420138],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01409454,0.0001473889,0.9460651,0.005109287,0.0009098933,0.0206443,0.00004634672,0.0006580979,0.01232505],"genre_scores_gemma":[0.9319169,0.00004078429,0.04003778,0.002105483,0.0005172097,0.02381837,0.00004230821,0.0000317707,0.001489398],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9178224,"threshold_uncertainty_score":0.3464641,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002733812,0.0002072187,0.0002148579,0.00009234851,0.0002305097,0.0002170655,0.00073173,0.00008850779,0.000001034518],"category_scores_gemma":[0.00003718725,0.0001796953,0.00006676612,0.000353504,0.00003349913,0.000313018,0.000122997,0.0001789046,0.00003145057],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001013146,"about_ca_system_score_gemma":0.00008061828,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001293244,"about_ca_topic_score_gemma":0.000009826361,"domain_scores_codex":[0.9984791,0.00005007738,0.0002638773,0.0004788579,0.0002737225,0.0004544028],"domain_scores_gemma":[0.998989,0.0001314983,0.0001391945,0.0004582782,0.000152496,0.0001294607],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009525429,0.0002100524,0.007086193,0.0001398124,0.0001899874,0.00001889333,0.005636279,0.940631,0.0008453685,0.00102762,0.000306131,0.0438134],"study_design_scores_gemma":[0.001163805,0.000177396,0.003217096,0.0003111956,0.00001311797,0.00003071287,0.0002048679,0.9904786,0.0004124861,0.00002018534,0.003716021,0.0002544725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1300725,0.0002458554,0.8679707,0.0002058622,0.0003165964,0.0004034672,0.0000134849,0.0004009436,0.0003706181],"genre_scores_gemma":[0.7653486,0.000001197744,0.2339782,0.00003360306,0.000216418,0.00003975106,0.000007874481,0.00001765344,0.0003566862],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6352761,"threshold_uncertainty_score":0.7327763,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}