{"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":"dc3640a03f9a","filters":{"venue":"IASTED International Conference on Parallel and Distributed Computing and Systems"}},"results":[{"id":"W206250993","doi":"","title":"Adaptive speculative locking protocol for distributed real-time database systems","year":2007,"lang":"en","type":"article","venue":"IASTED International Conference on Parallel and Distributed Computing and Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Computer science; Concurrency control; Two-phase commit protocol; Two-phase locking; Distributed transaction; Protocol (science); Optimistic concurrency control; Distributed computing; Serializability; Transaction processing; Database transaction; Online transaction processing; Distributed database; Distributed concurrency control; Parallel computing; Database","retraction":null,"screen_n_in":null,"score":{"opus":0.06597769050967398,"gpt":0.3386427341968287,"spread":0.2726650436871547,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00113181,0.0004797991,0.0006267999,0.0001839564,0.0004341187,0.001046843,0.0007199635,0.0001949348,0.000005083519],"category_scores_gemma":[0.00009837944,0.0004211051,0.00009466443,0.0003345411,0.0001212814,0.0004257748,0.0002851711,0.0002646116,0.00001422188],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001537855,"about_ca_system_score_gemma":0.00008692427,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003200134,"about_ca_topic_score_gemma":0.000006547387,"domain_scores_codex":[0.9965023,0.0001768953,0.00102303,0.001001623,0.0006368617,0.0006592695],"domain_scores_gemma":[0.9971655,0.0004641995,0.0006622216,0.0004599008,0.0009048556,0.0003433337],"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.0008390621,0.0003612952,0.0009225977,0.0003601415,0.0003869684,0.0001227973,0.0007371636,0.01542839,0.001756025,0.9704178,0.004421502,0.004246243],"study_design_scores_gemma":[0.002752475,0.0003353929,0.00140496,0.0010662,0.00001294988,0.0001251466,0.001019578,0.9886656,0.0000338668,0.0004115056,0.003642974,0.0005293566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003583169,0.00003051461,0.9711114,0.0001975882,0.0006604285,0.01957586,0.00172863,0.0002814302,0.002830939],"genre_scores_gemma":[0.9914731,0.000005950931,0.001842202,0.00002994761,0.0003194434,0.005165525,0.0009252623,0.0000213538,0.0002171497],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.98789,"threshold_uncertainty_score":0.9999902,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1824098691","doi":"","title":"A mobile agent based workflow rescheduling approach for grids","year":2007,"lang":"en","type":"article","venue":"IASTED International Conference on Parallel and Distributed Computing and Systems","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":3,"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":"Workflow; Computer science; Workflow management system; Distributed computing; Workflow technology; Schedule; Grid; Workflow engine; Scheduling (production processes); Resource (disambiguation); Grid computing; Database; Operating system; Computer network; Engineering; Operations management","retraction":null,"screen_n_in":null,"score":{"opus":0.04982545931768195,"gpt":0.3011942267714632,"spread":0.2513687674537812,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001302071,0.0003617562,0.0004398232,0.0002065769,0.000375997,0.0008787968,0.000737813,0.0001807199,0.000002149639],"category_scores_gemma":[0.0000837855,0.0003274647,0.0001083238,0.0002857832,0.00007775632,0.0001542911,0.0001878945,0.0002539511,0.000004533311],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007579665,"about_ca_system_score_gemma":0.00006927267,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004862116,"about_ca_topic_score_gemma":0.000001377372,"domain_scores_codex":[0.997255,0.0001268565,0.0007268658,0.0008361239,0.0004869259,0.0005681718],"domain_scores_gemma":[0.998212,0.0003579427,0.0003315259,0.0003741165,0.0004367995,0.0002876447],"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.0004670326,0.0006084832,0.003249012,0.0004314957,0.0003452073,0.00005558344,0.001609229,0.528024,0.0004709079,0.431421,0.002430289,0.03088789],"study_design_scores_gemma":[0.001479464,0.000315157,0.0007190258,0.0002814372,0.00001113377,0.00006015072,0.000550382,0.9924675,0.00001330853,0.0004761347,0.003240763,0.0003855986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01762489,0.0003370976,0.9767317,0.0001384512,0.001135469,0.0006439011,0.0001279591,0.0002755231,0.00298503],"genre_scores_gemma":[0.9651431,0.00001447896,0.0337333,0.0001182583,0.000302556,0.00005188979,0.0004775957,0.00001526569,0.0001435963],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9475182,"threshold_uncertainty_score":0.9999177,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W75303139","doi":"","title":"Automatic task generation for the multi-level computing architecture","year":2007,"lang":"en","type":"article","venue":"IASTED International Conference on Parallel and Distributed Computing and Systems","topic":"Parallel Computing and Optimization Techniques","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":"University of Toronto","funders":"","keywords":"Computer science; Compiler; Task (project management); Code generation; Computer architecture; Programming language; Heuristic; Parallel computing; Source code; Optimizing compiler; Control flow; Operating system; Artificial intelligence; Key (lock)","retraction":null,"screen_n_in":null,"score":{"opus":0.08904346494722962,"gpt":0.3247383573214794,"spread":0.2356948923742498,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001006989,0.0002532415,0.0002548982,0.0001450767,0.0005939241,0.0007286884,0.0005999351,0.0001137573,0.000001665874],"category_scores_gemma":[0.0001435035,0.0001884195,0.00006111596,0.000175235,0.00007917272,0.0001116183,0.0002048831,0.0002234638,0.000002215191],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000432279,"about_ca_system_score_gemma":0.0000378588,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004933318,"about_ca_topic_score_gemma":0.000008781011,"domain_scores_codex":[0.9981824,0.0001035159,0.0005394176,0.0005172163,0.00031583,0.0003416888],"domain_scores_gemma":[0.9983707,0.0005621142,0.0003056899,0.0002807136,0.0003620141,0.0001187772],"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.00007401962,0.0002456833,0.000867698,0.000129906,0.0003308829,0.00001789727,0.004112686,0.3392127,0.001714703,0.3624291,0.002666246,0.2881984],"study_design_scores_gemma":[0.0007393343,0.00009491417,0.001962253,0.0001250695,0.000009384564,0.00007078035,0.000291115,0.9955522,0.0000401048,0.0003537908,0.0005306429,0.0002304307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01682748,0.0002256148,0.9800706,0.001059403,0.0007549186,0.0004608922,0.00005290207,0.0003348239,0.0002134004],"genre_scores_gemma":[0.9235106,0.0000268167,0.07579243,0.0002104117,0.0002348106,0.00001113875,0.0001062826,0.00001008381,0.00009744593],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9066831,"threshold_uncertainty_score":0.7683523,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W41495264","doi":"","title":"Associativity-based adaptive weighted clustering for large-scale mobile ad hoc networks","year":2007,"lang":"en","type":"article","venue":"IASTED International Conference on Parallel and Distributed Computing and Systems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Cluster analysis; Computer science; Wireless ad hoc network; Mobile ad hoc network; Computer network; Node (physics); Distributed computing; Stability (learning theory); Overhead (engineering); Wireless; Engineering; Artificial intelligence; Network packet","retraction":null,"screen_n_in":null,"score":{"opus":0.02834229652280277,"gpt":0.2825772182522184,"spread":0.2542349217294156,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009665117,0.000283108,0.0003831573,0.0001149541,0.0003294175,0.0004752983,0.0004769277,0.0001917073,0.000004059703],"category_scores_gemma":[0.00003158994,0.0002717488,0.0000798434,0.0002122477,0.0000468986,0.0001794048,0.0002178836,0.0002802336,0.000002706547],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000107282,"about_ca_system_score_gemma":0.00004514679,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001271325,"about_ca_topic_score_gemma":0.00004690796,"domain_scores_codex":[0.9977863,0.0001258558,0.0005245998,0.0006474233,0.0003635955,0.0005522475],"domain_scores_gemma":[0.9981322,0.0006300795,0.0003575476,0.0002567226,0.0004181725,0.0002052738],"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.001252756,0.0008883657,0.005400527,0.0001766726,0.0006344832,0.00008769973,0.002819716,0.5934231,0.0001939891,0.2479829,0.002812568,0.1443272],"study_design_scores_gemma":[0.001624798,0.000355796,0.001625146,0.0002399054,0.00001030061,0.00001513417,0.0005375546,0.9926614,0.000007196107,0.0002933845,0.002328758,0.0003006757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01885322,0.0006797502,0.9777485,0.0001696115,0.0009802863,0.0005971761,0.0001334091,0.0001858653,0.0006521859],"genre_scores_gemma":[0.9911683,0.00006208164,0.00802756,0.0001478959,0.0002090254,0.00006280831,0.00022219,0.00001426593,0.00008591576],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.972315,"threshold_uncertainty_score":0.9999735,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W160097373","doi":"","title":"The impact of runtime estimation inaccuracy on scheduler performance","year":2007,"lang":"en","type":"article","venue":"IASTED International Conference on Parallel and Distributed Computing and Systems","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 Toronto; IBM (Canada)","funders":"","keywords":"Computer science; Heuristics; Scheduling (production processes); Grid; Execution time; Estimation; Real-time computing; Performance improvement; Distributed computing; Algorithm; Mathematical optimization; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03410264880780577,"gpt":0.3181380936565649,"spread":0.2840354448487591,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001048779,0.0002713066,0.0003091118,0.0001405684,0.0004017582,0.0005693448,0.0006773878,0.0001042276,0.000002314331],"category_scores_gemma":[0.0001248425,0.0001827816,0.00008292108,0.0002668888,0.0001106831,0.0002051628,0.000174003,0.0002524395,0.00001379648],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007619803,"about_ca_system_score_gemma":0.00006471038,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001560361,"about_ca_topic_score_gemma":0.000001534871,"domain_scores_codex":[0.9979401,0.0001200722,0.0006644185,0.0004200211,0.0004793134,0.00037607],"domain_scores_gemma":[0.9980883,0.0005360994,0.0004717168,0.000355162,0.0004026509,0.0001460818],"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.000417926,0.0002827933,0.01457429,0.00009571437,0.0003737327,0.00001607391,0.001070053,0.4522823,0.0003238015,0.4755858,0.001047647,0.05392994],"study_design_scores_gemma":[0.0006353885,0.000418998,0.05194968,0.0003456589,0.000004624535,0.00006468975,0.0001922442,0.9455781,0.00001701355,0.000389254,0.0002029173,0.0002014559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4952296,0.0001031864,0.5006872,0.00019412,0.0005294265,0.0001899351,0.0000350865,0.00008333084,0.002948135],"genre_scores_gemma":[0.9991378,0.00004125538,0.0005277852,0.00001879115,0.0000961425,0.000004552979,0.00008036938,0.000007579127,0.00008578555],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5039082,"threshold_uncertainty_score":0.7453616,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}