{"meta":{"query_hash":"dc3640a03f9a","filters":{"venue":"IASTED International Conference on Parallel and Distributed Computing and Systems"},"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/dc3640a03f9a","api":"https://metacan.xera.ac/api/v1/cohort?venue=IASTED+International+Conference+on+Parallel+and+Distributed+Computing+and+Systems"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.034102648807805766,"score_gpt":0.3181380936565649,"score_spread":0.28403544484875914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W160097373","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.9556288,0.0020224107,0.03790691,0.00039642525,0.00019583631,0.00005061172,0.00034334735,0.001921818,0.0015337932],"genre_scores_gemma":[0.99029255,0.00028831535,0.008655997,0.00006964136,0.0000356216,0.000017488968,0.00026632787,0.00018818953,0.00018582685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98886895,0.003871478,0.0011574941,0.0017534755,0.0033971693,0.00095143804],"domain_scores_gemma":[0.89071727,0.08591641,0.009240915,0.008422033,0.0048888563,0.0008145925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008480149,0.001118191,0.0011151524,0.0009722581,0.0008494237,0.0015157885,0.0010540045,0.000899179,0.0005674341],"category_scores_gemma":[0.07317861,0.0006835587,0.0004944967,0.0018133714,0.0008161083,0.0020639405,0.0011075732,0.0012591687,0.00027602442],"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.0034463825,0.00034095914,0.09066609,0.0005685688,0.00068105775,0.00060967705,0.0005365204,0.77521366,0.033133097,0.0013422474,0.00169821,0.091763556],"study_design_scores_gemma":[0.0002961343,0.0020718114,0.06761573,0.00013909164,0.00053730933,0.0009317551,0.0004792417,0.7580667,0.1641277,0.0025225282,0.0029588605,0.0002531177],"about_ca_topic_score_codex":0.0047030346,"about_ca_topic_score_gemma":0.0025027047,"teacher_disagreement_score":0.008480149,"about_ca_system_score_codex":0.0010316088,"about_ca_system_score_gemma":0.0015691306,"threshold_uncertainty_score":0.044847846},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.049825459317681946,"score_gpt":0.3011942267714632,"score_spread":0.25136876745378123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1824098691","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.008584807,0.00034455594,0.98408175,0.00030061216,0.00016494132,0.000104175706,0.00003669278,0.0010415227,0.005340851],"genre_scores_gemma":[0.27088276,0.0005233188,0.7140657,0.0001831854,0.0001034807,0.00025799256,0.00015180172,0.00015181332,0.01367996],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997296,0.00008039289,0.000015285417,0.00004452701,0.00010377899,0.000026417885],"domain_scores_gemma":[0.9998448,0.000038209695,0.000015270232,0.000030367817,0.000048319867,0.000023036308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033226865,0.00029794453,0.0004452337,0.00029036784,0.00068178127,0.00064163376,0.0011461491,0.00051573373,0.0015387682],"category_scores_gemma":[0.00042257595,0.00016673145,0.00043374705,0.00034188756,0.00030107642,0.000574301,0.00061027374,0.00065577443,0.0005286756],"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.00029841464,0.00030572218,0.0007449247,0.00024691055,0.00012800795,0.00069490133,0.00046316397,0.40514055,0.039281685,0.12277951,0.013261309,0.41665488],"study_design_scores_gemma":[0.000044645283,0.00007198937,0.00012483344,0.000010752754,0.000022703805,0.0001220834,0.00004745663,0.94420034,0.005681709,0.015615844,0.03403853,0.000019056812],"about_ca_topic_score_codex":0.0035425995,"about_ca_topic_score_gemma":0.004321718,"teacher_disagreement_score":0.0035425995,"about_ca_system_score_codex":0.00043858352,"about_ca_system_score_gemma":0.0009009989,"threshold_uncertainty_score":0.0070439577},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06597769050967398,"score_gpt":0.33864273419682867,"score_spread":0.2726650436871547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W206250993","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.052662123,0.00062536827,0.9415745,0.00045467235,0.00015114658,0.00020907956,0.000054476575,0.0012071044,0.003061543],"genre_scores_gemma":[0.85424036,0.0003543698,0.1424262,0.00017233513,0.00007560084,0.000340767,0.00014306814,0.0000648266,0.0021824806],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988927,0.0004022275,0.000120034114,0.000105490195,0.00039621742,0.000083343664],"domain_scores_gemma":[0.9978276,0.00073423254,0.00022443004,0.00059187436,0.0005162738,0.00010563489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015806425,0.00021774114,0.0002827362,0.0003897922,0.00050136895,0.0010806951,0.001621421,0.0004952736,0.0014821409],"category_scores_gemma":[0.003916445,0.00020303439,0.00020351273,0.00044563072,0.000934386,0.0019047309,0.0011448594,0.00085151085,0.0002584491],"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.0015225287,0.00035876175,0.0057134363,0.00073411997,0.00014085184,0.0013376044,0.0014667851,0.20919111,0.23949113,0.22481869,0.01014025,0.30508468],"study_design_scores_gemma":[0.00037568426,0.00046628778,0.0004646702,0.00004004693,0.00006244939,0.000503326,0.00015195036,0.88046026,0.05249639,0.03735575,0.027544565,0.00007865748],"about_ca_topic_score_codex":0.0006069353,"about_ca_topic_score_gemma":0.0006131475,"teacher_disagreement_score":0.001621421,"about_ca_system_score_codex":0.000410344,"about_ca_system_score_gemma":0.0010314146,"threshold_uncertainty_score":0.008359313},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02834229652280277,"score_gpt":0.28257721825221843,"score_spread":0.25423492172941564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W41495264","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.009263721,0.00021507803,0.989771,0.0000601055,0.00002511127,0.000020060874,0.0000067096125,0.00011911995,0.0005190526],"genre_scores_gemma":[0.62120616,0.0006808318,0.37443012,0.000081012804,0.0001236184,0.00021851639,0.000088334804,0.00010178878,0.003069702],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990829,0.0002427337,0.00004976135,0.00013221377,0.0004248007,0.00006746066],"domain_scores_gemma":[0.9978643,0.0009732007,0.00024619277,0.00020407431,0.0006325145,0.00007967161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016381635,0.0005820242,0.0006202296,0.0008092375,0.0008057468,0.0008858298,0.0017170773,0.00075785856,0.00085220806],"category_scores_gemma":[0.0051703695,0.00030754803,0.0005083963,0.0012255261,0.0009289941,0.002328777,0.00089817896,0.00076463656,0.0003307945],"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.000065539076,0.00004675998,0.0011352288,0.00008482138,0.00007535577,0.000085971136,0.00015501658,0.8939381,0.0043542013,0.046914667,0.0007162031,0.05242806],"study_design_scores_gemma":[0.0000036605566,0.000019089106,0.000117253985,0.0000025789766,0.000009502225,0.000029215622,0.000013742183,0.9893506,0.00055103865,0.009354243,0.0005420839,0.0000069731445],"about_ca_topic_score_codex":0.0024512047,"about_ca_topic_score_gemma":0.0020033894,"teacher_disagreement_score":0.0024512047,"about_ca_system_score_codex":0.0010007637,"about_ca_system_score_gemma":0.00074101955,"threshold_uncertainty_score":0.008663535},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.08904346494722962,"score_gpt":0.3247383573214794,"score_spread":0.23569489237424976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W75303139","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.062328603,0.00015267172,0.9287126,0.00014144908,0.000037028043,0.00013502818,0.00023544593,0.0057408656,0.0025161868],"genre_scores_gemma":[0.21802917,0.00006680585,0.7787444,0.00006403344,0.000007857773,0.0001805417,0.00064574083,0.0006629747,0.0015984448],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967456,0.00007620236,0.000022303835,0.00006991589,0.00011476822,0.000042244952],"domain_scores_gemma":[0.9991597,0.00036186088,0.00007428211,0.00018627562,0.000188594,0.00002925488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036419422,0.0004952571,0.00029241978,0.0005179301,0.00044790722,0.00047839395,0.00065364107,0.00037233994,0.0017479389],"category_scores_gemma":[0.0017050001,0.0003054893,0.0004540386,0.00039795408,0.00039650695,0.00055565464,0.0004949926,0.00082353316,0.0005346705],"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.00065770885,0.00018115391,0.0042632646,0.00067149824,0.000047761732,0.00034741123,0.0006618686,0.2297312,0.15138458,0.034073256,0.012629003,0.5653513],"study_design_scores_gemma":[0.0000611275,0.00010368382,0.00064374733,0.000027453023,0.000018547164,0.00013024102,0.000056265737,0.9003854,0.07046462,0.013738286,0.0143514145,0.000019238658],"about_ca_topic_score_codex":0.002212624,"about_ca_topic_score_gemma":0.0036511405,"teacher_disagreement_score":0.002212624,"about_ca_system_score_codex":0.00057598914,"about_ca_system_score_gemma":0.0019821443,"threshold_uncertainty_score":0.005847454},"labels":[],"label_agreement":null}]}