{"meta":{"query_hash":"52604394b71c","filters":{"venue":"ACM SIGAda Ada Letters"},"cohort_total":25,"direct_labels_cover":0,"predictions_cover":25,"exported":25,"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/52604394b71c","api":"https://metacan.xera.ac/api/v1/cohort?venue=ACM+SIGAda+Ada+Letters"},"results":[{"id":"W1965117069","doi":"10.1145/2070336.2070357","title":"Enhancing spark's contract checking facilities using symbolic execution","year":2011,"lang":"en","type":"article","venue":"ACM SIGAda Ada Letters","topic":"Software Testing and Debugging Techniques","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":"Concordia University","funders":"","keywords":"Computer science; Symbolic execution; SPARK (programming language); Software engineering; Usability; Programming language; Automation; Design by contract; Software; Model checking; Formal methods; Software development; Software construction; Operating system; Engineering","score_opus":0.06601541650421534,"score_gpt":0.25624669602452055,"score_spread":0.19023127952030522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965117069","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.52259547,0.000078529025,0.47224662,0.00032266244,0.00032166144,0.000109347275,0.0000012167569,0.004124087,0.00020041094],"genre_scores_gemma":[0.73467857,0.0000021337505,0.2635339,0.0016692481,0.00007775585,0.000010936705,0.0000011407614,0.000014598409,0.0000117191275],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983309,0.000081309874,0.00032054432,0.00045641075,0.0003170657,0.00049380574],"domain_scores_gemma":[0.9983162,0.0003672179,0.00016065183,0.0010002076,0.00006111559,0.00009460219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042745873,0.00023224439,0.00023697378,0.00016184288,0.00023117579,0.00015376645,0.0011299015,0.00007785767,0.000016452726],"category_scores_gemma":[0.0006658025,0.00023533354,0.00008849719,0.0002667883,0.000080967475,0.0006870411,0.0003569728,0.00022408526,0.000016497968],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00006784341,0.00027931237,0.06071586,0.00037477573,0.00025162855,0.0008546796,0.052694388,0.00031161308,0.80829525,0.008330189,0.018318182,0.049506295],"study_design_scores_gemma":[0.0012286954,0.00031226047,0.038052846,0.0016175635,0.000103406084,0.00068502926,0.00031261527,0.039131556,0.85673517,0.055704672,0.0028811423,0.0032350256],"about_ca_topic_score_codex":0.0025344722,"about_ca_topic_score_gemma":0.000019240502,"teacher_disagreement_score":0.2120831,"about_ca_system_score_codex":0.00011085384,"about_ca_system_score_gemma":0.00005834852,"threshold_uncertainty_score":0.9596623},"labels":[],"label_agreement":null},{"id":"W1986783865","doi":"10.1145/1806546.1806552","title":"Named memory pool for Ada","year":2010,"lang":"en","type":"article","venue":"ACM SIGAda Ada Letters","topic":"Real-Time Systems Scheduling","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":"General Dynamics (Canada)","funders":"","keywords":"Computer science; Simple (philosophy); Memory management; Programming language; Distributed computing; Operating system; Semiconductor memory","score_opus":0.01178120214542567,"score_gpt":0.23821282196695429,"score_spread":0.22643161982152862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986783865","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.7071075,0.00004481944,0.25742117,0.029529583,0.004069098,0.0008295623,0.0000048542624,0.00044795193,0.0005455022],"genre_scores_gemma":[0.7809214,7.745277e-7,0.21096025,0.007067344,0.0006435928,0.00012616473,0.0000055103646,0.000038677437,0.00023629982],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.997742,0.000066785935,0.00040555073,0.00067127805,0.0004888659,0.00062552455],"domain_scores_gemma":[0.9967599,0.00070487475,0.00019372687,0.0020440978,0.00009147047,0.00020593518],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006230882,0.00026642546,0.00029858036,0.00013024798,0.00020120702,0.00031491762,0.0027556638,0.00012369813,0.000029786384],"category_scores_gemma":[0.00064226077,0.00025381372,0.00016753962,0.00028545203,0.0000731753,0.00084135693,0.00044287558,0.00037716297,0.00014501656],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.000014927837,0.00003595011,0.00034831147,0.00007700664,0.0000671677,0.000068627494,0.00079313153,0.00030309008,0.92779016,0.0024016823,0.049814794,0.018285157],"study_design_scores_gemma":[0.008195132,0.0005229335,0.008604145,0.00042280555,0.00015100009,0.00077431434,0.00065409264,0.101687655,0.66072905,0.0077955984,0.20528033,0.0051829726],"about_ca_topic_score_codex":0.0002694151,"about_ca_topic_score_gemma":0.00007365178,"teacher_disagreement_score":0.26706114,"about_ca_system_score_codex":0.00005004996,"about_ca_system_score_gemma":0.000111203655,"threshold_uncertainty_score":0.9999914},"labels":[],"label_agreement":null},{"id":"W2001010400","doi":"10.1145/1806546.1806564","title":"Conclusions of the 14th international real-time Ada workshop","year":2010,"lang":"en","type":"article","venue":"ACM SIGAda Ada Letters","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Citation; Computer science; Software; Library science; World Wide Web; Operating system","score_opus":0.008741895914681243,"score_gpt":0.23653758495853236,"score_spread":0.2277956890438511,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001010400","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.92932314,0.000008247948,0.011053637,0.049216043,0.0044175144,0.00031939737,0.0000064016895,0.00016302345,0.0054925894],"genre_scores_gemma":[0.94726604,0.0000042136253,0.050179575,0.0017069136,0.0004046278,0.000017023443,0.0000038626144,0.000022278811,0.00039545275],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99790597,0.00011661418,0.000447695,0.00043525014,0.00076086976,0.000333578],"domain_scores_gemma":[0.9967062,0.0007191184,0.0003159099,0.0020272841,0.00012146883,0.00011002511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048974017,0.00019822267,0.00023857225,0.000098058445,0.0001908879,0.00015750091,0.0045919837,0.00010097644,0.000118296164],"category_scores_gemma":[0.0006312628,0.00014898139,0.00016311825,0.00041775292,0.00015861489,0.0005466299,0.0018260318,0.00043306372,0.00009027577],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0000057018115,0.00003477386,0.002153589,0.000009339718,0.000060341637,0.000025583477,0.0008339973,0.00041765175,0.9669107,0.00287577,0.023702506,0.0029699975],"study_design_scores_gemma":[0.008053772,0.0002920192,0.114247344,0.002088997,0.00026282793,0.0015309649,0.0015273232,0.16620876,0.47089586,0.007841158,0.22118314,0.005867826],"about_ca_topic_score_codex":0.00043968405,"about_ca_topic_score_gemma":0.000055883844,"teacher_disagreement_score":0.4960149,"about_ca_system_score_codex":0.000051866027,"about_ca_system_score_gemma":0.00012494945,"threshold_uncertainty_score":0.85331243},"labels":[],"label_agreement":null},{"id":"W2006432698","doi":"10.1145/2552999.2553002","title":"Parallelism in Ada","year":2013,"lang":"en","type":"article","venue":"ACM SIGAda Ada Letters","topic":"Parallel Computing and Optimization Techniques","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":"General Dynamics (Canada)","funders":"","keywords":"Computer science; Task parallelism; Parallelism (grammar); Concurrency; Parallel computing; Instruction-level parallelism; Implicit parallelism; Data parallelism; Task (project management); Divide and conquer algorithms; Syntax; sort; Programming language","score_opus":0.012020248883993438,"score_gpt":0.22552745749777062,"score_spread":0.21350720861377717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006432698","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.18719347,0.00012120617,0.7722168,0.03741035,0.0003262383,0.00034835612,3.7936766e-7,0.0008014766,0.0015817144],"genre_scores_gemma":[0.64229333,0.000016335804,0.34315386,0.014271283,0.000058160185,0.000053882515,0.0000026185305,0.000012327178,0.00013819733],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986362,0.00008113263,0.00027791125,0.0003860713,0.00024882055,0.0003698761],"domain_scores_gemma":[0.9987084,0.000162587,0.00008063873,0.0009231119,0.00004020695,0.00008504243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016640777,0.00016207031,0.00016920503,0.00016123678,0.00007038079,0.00019454987,0.001693446,0.00006015545,0.000041586078],"category_scores_gemma":[0.00009244365,0.00015619062,0.000052092215,0.00040118943,0.000036318812,0.00059098355,0.0004429642,0.00019378519,0.00016590783],"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.0000097296615,0.00022267252,0.013236843,0.000050089868,0.00005140909,0.00018757799,0.0030164164,0.04701595,0.015236194,0.012566596,0.8362955,0.07211103],"study_design_scores_gemma":[0.0040166867,0.00034788097,0.100241095,0.0004747403,0.00001748912,0.0001338543,0.00018251652,0.7258253,0.020560293,0.059817925,0.08419896,0.004183219],"about_ca_topic_score_codex":0.0006819274,"about_ca_topic_score_gemma":0.000014557711,"teacher_disagreement_score":0.75209653,"about_ca_system_score_codex":0.000049471862,"about_ca_system_score_gemma":0.000028004491,"threshold_uncertainty_score":0.6369269},"labels":[],"label_agreement":null},{"id":"W2007444920","doi":"10.1145/1031414.1031417","title":"The PragmAda reusable components","year":2004,"lang":"en","type":"article","venue":"ACM SIGAda Ada Letters","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":"Apache (Canada)","funders":"","keywords":"Computer science; Variety (cybernetics); Component (thermodynamics); Software engineering; Artificial intelligence","score_opus":0.01552825387454623,"score_gpt":0.22053716161112305,"score_spread":0.20500890773657682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007444920","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42079765,0.0003950532,0.46987888,0.10277555,0.0033322228,0.00043935466,0.000005792929,0.0006214825,0.0017540114],"genre_scores_gemma":[0.9842249,0.000006782006,0.010751979,0.004635347,0.00018593956,0.000014190002,0.000009132418,0.000013086204,0.00015864159],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99818283,0.00009680421,0.00030594776,0.0003941029,0.00048991636,0.000530367],"domain_scores_gemma":[0.99774736,0.00034677202,0.00014079029,0.0016062221,0.00004623865,0.00011259349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004253808,0.00018803944,0.00016502805,0.000036284495,0.00055824313,0.0004889598,0.0033558542,0.00004530908,0.0000022799074],"category_scores_gemma":[0.00013983971,0.00013719808,0.0000880706,0.00036178913,0.00007590554,0.00029910746,0.00061388983,0.00021274376,0.00021551887],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000075683056,0.00044497676,0.0063929628,0.00014542315,0.00053034734,0.0010508754,0.0038288499,0.1314086,0.06805813,0.2062757,0.5645596,0.017228879],"study_design_scores_gemma":[0.0029072708,0.00018271088,0.010601614,0.00033065863,0.000022732,0.00029813257,0.00010711003,0.0065798378,0.004030805,0.020131977,0.95347816,0.0013290246],"about_ca_topic_score_codex":0.00037391094,"about_ca_topic_score_gemma":0.00002051658,"teacher_disagreement_score":0.56342727,"about_ca_system_score_codex":0.00010200816,"about_ca_system_score_gemma":0.00006746226,"threshold_uncertainty_score":0.6236068},"labels":[],"label_agreement":null},{"id":"W2016069715","doi":"10.1145/2070336.2070352","title":"How to make ada go 'viral'","year":2011,"lang":"en","type":"article","venue":"ACM SIGAda Ada Letters","topic":"Language and cultural evolution","field":"Social Sciences","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":"General Dynamics (Canada)","funders":"","keywords":"Popularity; Mainstream; Point (geometry); Computer science; Viral marketing; World Wide Web; Advertising; Internet privacy; Business; Psychology; Political science; Social psychology; Social media","score_opus":0.03229160905340734,"score_gpt":0.253286128761819,"score_spread":0.22099451970841166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016069715","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.91449606,0.00010335716,0.00017627342,0.07219303,0.00062929455,0.00028367134,0.0000051910583,0.00016733243,0.011945763],"genre_scores_gemma":[0.96885103,0.000009802538,0.0024736999,0.018583406,0.0005860227,0.000023535948,0.0000058744426,0.000013070719,0.009453582],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987519,0.000093393064,0.00010897644,0.0002463083,0.0003805702,0.00041886995],"domain_scores_gemma":[0.99935526,0.000042463234,0.000051603674,0.0003344737,0.000042108608,0.00017407608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018144002,0.00012138813,0.00011751892,0.00003716869,0.00030030767,0.0001059862,0.00057287613,0.00007248238,0.00036961478],"category_scores_gemma":[0.00035619774,0.00010095209,0.00007531413,0.00023422838,0.0001102707,0.00033668376,0.00009719939,0.0001139099,0.00027609852],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000083245606,0.000090841044,0.0072670314,0.000021006228,0.00009317496,0.00027627367,0.15690048,0.000004905319,0.098781,0.009052366,0.6795838,0.04784591],"study_design_scores_gemma":[0.0003566248,0.00008735466,0.015884448,0.00003989791,0.00004103647,0.0000040193536,0.0173369,0.0000013672998,0.006035045,0.0013439598,0.95826,0.0006093381],"about_ca_topic_score_codex":0.008590459,"about_ca_topic_score_gemma":0.008134302,"teacher_disagreement_score":0.27867624,"about_ca_system_score_codex":0.000079924925,"about_ca_system_score_gemma":0.000035298268,"threshold_uncertainty_score":0.9980114},"labels":[],"label_agreement":null},{"id":"W2030134136","doi":"10.1145/2552999.2553004","title":"Ada and many-core platforms","year":2013,"lang":"en","type":"article","venue":"ACM SIGAda Ada Letters","topic":"Parallel Computing and Optimization Techniques","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":"General Dynamics (Canada)","funders":"Fundação para a Ciência e a Tecnologia","keywords":"Programmer; Computer science; Core (optical fiber); Distributed computing; Many core; Software engineering; Programming language; Parallel computing; Telecommunications","score_opus":0.017692085922585147,"score_gpt":0.22841984504719656,"score_spread":0.21072775912461142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030134136","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4008055,0.00008212449,0.589713,0.007928815,0.00017168281,0.00019792475,4.7685506e-7,0.0006048234,0.00049567106],"genre_scores_gemma":[0.65649056,0.000020193165,0.33193272,0.011305132,0.00006327029,0.00002537689,0.000002942139,0.000012833442,0.00014700592],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891895,0.0000122698875,0.00019618697,0.00035416958,0.00021982632,0.0002986109],"domain_scores_gemma":[0.9989091,0.00012688302,0.00008105383,0.0007316883,0.000041421707,0.0001098079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011470242,0.00016058462,0.00014567771,0.00009429128,0.00014228435,0.00023612761,0.0010479919,0.000055040324,0.000023586374],"category_scores_gemma":[0.00005797472,0.00013769088,0.000037699243,0.0002045042,0.000055654567,0.0006572111,0.00053260353,0.00014804011,0.00006483755],"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.000013127668,0.00011876306,0.020535052,0.000113999355,0.00012346444,0.00012069413,0.003119362,0.004739953,0.023411883,0.039376155,0.7733424,0.13498516],"study_design_scores_gemma":[0.0030222842,0.00057177374,0.063110694,0.00041095904,0.000041274096,0.0003896894,0.00024685144,0.7488754,0.03580187,0.10239474,0.041200254,0.003934212],"about_ca_topic_score_codex":0.00017185928,"about_ca_topic_score_gemma":0.0000022278687,"teacher_disagreement_score":0.74413544,"about_ca_system_score_codex":0.000023973784,"about_ca_system_score_gemma":0.00001650216,"threshold_uncertainty_score":0.56148714},"labels":[],"label_agreement":null},{"id":"W2052173215","doi":"10.1145/959221.959238","title":"An approach to formal verication of real time concurrent Ada programs","year":2003,"lang":"en","type":"article","venue":"ACM SIGAda Ada Letters","topic":"Formal Methods in Verification","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":"National Research Council Canada; Carleton University","funders":"","keywords":"Computer science; Correctness; SPARK (programming language); Programming language; Automated theorem proving; Code (set theory); Gas meter prover; Proof assistant; Static analysis; Model checking; Mathematics","score_opus":0.03251390474002544,"score_gpt":0.28535113440254917,"score_spread":0.25283722966252375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052173215","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24467605,0.000010319453,0.7522797,0.00034269373,0.00028001211,0.00046681394,0.0000017326727,0.000143689,0.0017989752],"genre_scores_gemma":[0.42458153,0.0000017471194,0.574837,0.00045137198,0.000028045986,0.00006616468,0.0000149383295,0.000010226407,0.000008909559],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981279,0.0002372446,0.00036500677,0.0004376146,0.0004517936,0.00038047656],"domain_scores_gemma":[0.99813235,0.000060604805,0.00019750453,0.0013672917,0.00008932621,0.00015291496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007508374,0.00016896674,0.00019482852,0.00010221737,0.00008745038,0.0000820596,0.0014928015,0.00005731363,0.0000047338003],"category_scores_gemma":[0.00017653276,0.0001664434,0.000056442215,0.00059584127,0.00007017516,0.0010738164,0.00014553251,0.0001211497,0.00003333602],"study_design_candidate":"bench_or_experimental","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.000050359202,0.0009960321,0.002373922,0.00015086048,0.00006883803,0.0000048788925,0.0056680134,0.0023972527,0.332673,0.24016443,0.0030544966,0.4123979],"study_design_scores_gemma":[0.0044305613,0.004003466,0.05973578,0.0002788738,0.00015359056,0.00018982892,0.0009515446,0.34646922,0.5072171,0.0037789152,0.06831022,0.004480892],"about_ca_topic_score_codex":0.000055003613,"about_ca_topic_score_gemma":7.0761683e-7,"teacher_disagreement_score":0.407917,"about_ca_system_score_codex":0.00008955302,"about_ca_system_score_gemma":0.000058788282,"threshold_uncertainty_score":0.67873645},"labels":[],"label_agreement":null},{"id":"W2075573329","doi":"10.1145/1806546.1806553","title":"Realtime paradigms needed post Ada 2005","year":2010,"lang":"en","type":"article","venue":"ACM SIGAda Ada Letters","topic":"Real-Time Systems Scheduling","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":"General Dynamics (Canada)","funders":"","keywords":"Computer science; Concurrency; Multiprocessing; Scheduling (production processes); Blocking (statistics); Programming language; Concurrency control; Distributed computing; Parallel computing; Computer architecture; Computer network","score_opus":0.007968287309009604,"score_gpt":0.220578211781564,"score_spread":0.2126099244725544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075573329","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.8998053,0.000061177794,0.022800526,0.07103992,0.0030355768,0.0004886958,0.0000059738773,0.0006343033,0.0021285273],"genre_scores_gemma":[0.8693323,0.000004059682,0.11386805,0.015532656,0.00077545084,0.00004262603,0.000014145539,0.000058216032,0.00037249696],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967495,0.00013253232,0.00057185994,0.000844678,0.0007343064,0.00096711796],"domain_scores_gemma":[0.99580747,0.00048927654,0.00027389426,0.0029366,0.00009023889,0.00040254163],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006970435,0.00038323933,0.00039521148,0.00020736559,0.00025112476,0.0005206787,0.0035275726,0.00017365125,0.000105886706],"category_scores_gemma":[0.00040919275,0.00036539245,0.00016627215,0.00046487962,0.00011253623,0.0013140258,0.00063245004,0.0006980103,0.00084424316],"study_design_candidate":"bench_or_experimental","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.000017562084,0.000060260416,0.0010089407,0.00003924414,0.00007648388,0.00022046345,0.0010362435,0.00028614266,0.9035988,0.004288259,0.08333225,0.0060353684],"study_design_scores_gemma":[0.008905045,0.00078721327,0.04334097,0.0007870721,0.0002100936,0.0028333995,0.0013800159,0.06744458,0.32312688,0.005084104,0.5363299,0.00977069],"about_ca_topic_score_codex":0.0028987422,"about_ca_topic_score_gemma":0.00030364064,"teacher_disagreement_score":0.5804719,"about_ca_system_score_codex":0.000078467194,"about_ca_system_score_gemma":0.00017056074,"threshold_uncertainty_score":0.9999337},"labels":[],"label_agreement":null},{"id":"W2086169821","doi":"10.1145/1165678.1165680","title":"Publisher FrameWork (PFW)","year":2006,"lang":"en","type":"article","venue":"ACM SIGAda Ada Letters","topic":"Distributed systems and fault tolerance","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":"Raytheon Technologies (Canada)","funders":"","keywords":"Computer science; Air traffic control; Fault tolerance; Component (thermodynamics); Object-oriented programming; Software; Aviation; Software engineering; Distributed computing; Engineering; Operating system","score_opus":0.00727781898003395,"score_gpt":0.20712566631015894,"score_spread":0.19984784733012498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086169821","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06336344,0.0003288409,0.8747323,0.051048733,0.0032836816,0.0002139738,0.000006701849,0.00051430386,0.006508036],"genre_scores_gemma":[0.92396194,0.0000015767649,0.06241959,0.012381952,0.00053871813,0.000031850566,0.000015037713,0.000020549507,0.0006287635],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99818057,0.000052633644,0.0003154605,0.000494737,0.0004730823,0.0004835081],"domain_scores_gemma":[0.99807537,0.0001817996,0.000114787945,0.0014779193,0.000056351342,0.00009379867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020327198,0.00019772483,0.00020616247,0.000068246074,0.00013575064,0.0006713879,0.002132378,0.000103874845,0.000026502405],"category_scores_gemma":[0.00012387223,0.00018296685,0.00009945621,0.00055332837,0.000050073588,0.00097017596,0.00031250488,0.00025817906,0.00015924289],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000002687199,0.000046888606,0.0036839447,0.000015077318,0.000016238597,0.000106802356,0.00008964171,0.0003135291,0.0018489859,0.05091257,0.9389979,0.003965685],"study_design_scores_gemma":[0.00070834823,0.000047840545,0.030048221,0.00018120017,0.000011895476,0.000060602855,0.00003509605,0.0017687507,0.0006927581,0.050202865,0.9151877,0.0010546952],"about_ca_topic_score_codex":0.00044762515,"about_ca_topic_score_gemma":0.00001946724,"teacher_disagreement_score":0.8605985,"about_ca_system_score_codex":0.000056055113,"about_ca_system_score_gemma":0.000032798518,"threshold_uncertainty_score":0.7461172},"labels":[],"label_agreement":null},{"id":"W2087022298","doi":"10.1145/584417.584422","title":"Practical implementations of embedded software using the Ravenscar Profile","year":2002,"lang":"en","type":"article","venue":"ACM SIGAda Ada Letters","topic":"Embedded Systems Design Techniques","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":"National Research Council Canada","funders":"","keywords":"Computer science; Implementation; Software; Programming language","score_opus":0.0949414484074329,"score_gpt":0.33756564262957756,"score_spread":0.24262419422214465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087022298","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04190495,0.000051868203,0.94505197,0.011673255,0.00021621492,0.00064233266,0.000009119898,0.00030561327,0.00014468354],"genre_scores_gemma":[0.4020033,0.0000025477718,0.59557384,0.0022460874,0.00006806885,0.00004994975,0.000002146175,0.000017876164,0.000036222074],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980352,0.00028583978,0.00045287315,0.0003426815,0.0005331686,0.000350259],"domain_scores_gemma":[0.9972387,0.0007894696,0.0002939307,0.0015104598,0.000102340506,0.000065107066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004238128,0.00017338058,0.00021152174,0.00010185789,0.00019248495,0.00010938582,0.0013354945,0.00005660099,0.00010574069],"category_scores_gemma":[0.00046673487,0.00013595949,0.00010729505,0.00045575073,0.00010984072,0.00057627464,0.00039434308,0.00021178635,0.000022252687],"study_design_candidate":"bench_or_experimental","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.000010383098,0.00020632075,0.0030650413,0.00014775645,0.00022807499,0.0001775211,0.009358037,0.00022750346,0.4169507,0.014576043,0.5487863,0.0062663318],"study_design_scores_gemma":[0.0026449163,0.00068303087,0.001968439,0.0006054786,0.00031332232,0.0014076147,0.003101064,0.13383663,0.82573587,0.008535369,0.018442499,0.0027257833],"about_ca_topic_score_codex":0.00010411188,"about_ca_topic_score_gemma":0.000006838592,"teacher_disagreement_score":0.5303438,"about_ca_system_score_codex":0.00007942988,"about_ca_system_score_gemma":0.000048038044,"threshold_uncertainty_score":0.5544267},"labels":[],"label_agreement":null},{"id":"W2094660491","doi":"10.1145/2070336.2070351","title":"Stack safe parallel recursion with paraffin","year":2011,"lang":"en","type":"article","venue":"ACM SIGAda Ada Letters","topic":"Parallel Computing and Optimization Techniques","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":"General Dynamics (Canada)","funders":"","keywords":"Stack (abstract data type); Call stack; Recursion (computer science); Computer science; Subroutine; Parallel computing; Parallelism (grammar); Feature (linguistics); Algorithm; Programming language; Distributed computing","score_opus":0.028880662582924443,"score_gpt":0.22369745894182513,"score_spread":0.1948167963589007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094660491","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037088607,0.00006057974,0.9552073,0.004019258,0.00015647602,0.00019618006,8.4625555e-7,0.0007769904,0.0024937738],"genre_scores_gemma":[0.2543473,0.000022560313,0.7404276,0.004967555,0.00003970309,0.000017706283,0.0000038161365,0.00001748921,0.0001562456],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99843806,0.00009469804,0.00024585993,0.00049676304,0.00033499178,0.0003896467],"domain_scores_gemma":[0.9983332,0.00012325453,0.00014910183,0.0012095763,0.00006389982,0.00012096319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021460053,0.00021932788,0.0001934289,0.000117692616,0.00015735859,0.00009581616,0.0017219739,0.00006402549,0.000035538924],"category_scores_gemma":[0.00005840958,0.0001820786,0.000055142304,0.00037749516,0.00007193453,0.00046118564,0.00035778608,0.00019057575,0.00006578206],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.0007206202,0.0010578234,0.016894497,0.00016990298,0.00041243676,0.0011395559,0.020258214,0.043478217,0.007190565,0.053688914,0.75277454,0.10221472],"study_design_scores_gemma":[0.01561709,0.00726477,0.06386962,0.0022572787,0.0002560141,0.0010670904,0.0007984747,0.29803872,0.17422582,0.04810448,0.37344638,0.015054244],"about_ca_topic_score_codex":0.00010982081,"about_ca_topic_score_gemma":0.000009170442,"teacher_disagreement_score":0.37932816,"about_ca_system_score_codex":0.00004103746,"about_ca_system_score_gemma":0.000046620644,"threshold_uncertainty_score":0.74249494},"labels":[],"label_agreement":null},{"id":"W2346824377","doi":"10.1145/2971571.2971573","title":"Reduction of Parallel Computation in the Parallel Model for Ada","year":2016,"lang":"en","type":"article","venue":"ACM SIGAda Ada Letters","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":"General Dynamics (Canada)","funders":"","keywords":"Parallel computing; Parallelism (grammar); Computer science; Reduction (mathematics); Computation; Loop (graph theory); Task parallelism; Automatic parallelization; Programming language; Compiler; Mathematics","score_opus":0.0331962137927896,"score_gpt":0.274088169665274,"score_spread":0.2408919558724844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2346824377","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.023960076,0.00003300275,0.9542017,0.021117793,0.00011600769,0.00038233926,0.0000024643448,0.00013685193,0.000049785176],"genre_scores_gemma":[0.54135954,0.000013388707,0.4574126,0.001091229,0.000032256234,0.000052417592,0.0000034828488,0.000007276077,0.000027789632],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865294,0.00011102631,0.00037217815,0.0003350061,0.00027832808,0.0002505378],"domain_scores_gemma":[0.9986831,0.0003968352,0.00020543928,0.0006040967,0.00007950397,0.00003102458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049868756,0.00014406374,0.00017542204,0.00013181879,0.00008805846,0.000047315712,0.0011893314,0.000056892084,9.1205345e-7],"category_scores_gemma":[0.00011356061,0.000094441595,0.000082802384,0.0002708821,0.00006508774,0.00037219186,0.00012583389,0.00007898348,0.000002223797],"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.000057595433,0.00009925979,0.00018931323,0.00003347726,0.000021221555,0.0000028684274,0.0022854684,0.9163006,0.009391194,0.010070228,0.041625503,0.019923301],"study_design_scores_gemma":[0.00088129146,0.00007704463,0.00041135494,0.000074262076,0.000006527691,0.000010781536,0.0000358005,0.97786385,0.001137848,0.018987413,0.0002902525,0.0002235799],"about_ca_topic_score_codex":0.000042252046,"about_ca_topic_score_gemma":0.000006581794,"teacher_disagreement_score":0.5173995,"about_ca_system_score_codex":0.00004715365,"about_ca_system_score_gemma":0.00004596588,"threshold_uncertainty_score":0.38512164},"labels":[],"label_agreement":null},{"id":"W2883140496","doi":"10.1145/3241950.3241953","title":"Synchronous Signals","year":2018,"lang":"en","type":"article","venue":"ACM SIGAda Ada Letters","topic":"Distributed systems and fault tolerance","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":"General Dynamics (Canada)","funders":"","keywords":"Computer science; Synchronizing; Concurrency; Synchronization (alternating current); Abstraction; Code (set theory); Interface (matter); Blocking (statistics); Concurrency control; Parallel computing; Distributed computing; Programming language; Computer network; Transmission (telecommunications); Set (abstract data type); Telecommunications","score_opus":0.012155640413538874,"score_gpt":0.23664149251902894,"score_spread":0.22448585210549007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883140496","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2203232,0.00018930272,0.7564837,0.018289562,0.0016486031,0.00023025868,0.000011515587,0.00040829115,0.002415583],"genre_scores_gemma":[0.97444874,0.000002058708,0.014033243,0.010841612,0.0005169249,0.000017270833,0.0000036948543,0.000012562401,0.00012387252],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984092,0.000057623216,0.00026705654,0.00046262675,0.00035721672,0.0004462901],"domain_scores_gemma":[0.9982533,0.00011477274,0.00010425979,0.0013206868,0.000080510916,0.00012649194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022061118,0.00017692627,0.00019906352,0.000058690366,0.00018299608,0.0002280101,0.0019781815,0.000054877597,0.00005895329],"category_scores_gemma":[0.00008530767,0.00016199412,0.00007564522,0.00036733836,0.00011329607,0.00047616093,0.0003362457,0.00011671783,0.0006661675],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000021068077,0.00014461373,0.002001098,0.00006657089,0.00014597645,0.00042166185,0.0019019902,0.0002290916,0.20634216,0.013404942,0.706465,0.068855844],"study_design_scores_gemma":[0.0020836522,0.00062917534,0.011455615,0.00038490785,0.000032724012,0.000280434,0.00012877997,0.019719852,0.06471232,0.003483435,0.89484906,0.0022400133],"about_ca_topic_score_codex":0.000110434565,"about_ca_topic_score_gemma":0.000013216974,"teacher_disagreement_score":0.75412554,"about_ca_system_score_codex":0.000054004307,"about_ca_system_score_gemma":0.000046219197,"threshold_uncertainty_score":0.8562458},"labels":[],"label_agreement":null},{"id":"W2999637374","doi":"10.1145/3379106.3379118","title":"Winners of 2018 SIGAda Awards","year":2020,"lang":"en","type":"article","venue":"ACM SIGAda Ada Letters","topic":"Data Quality and Management","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"General Dynamics (Canada)","funders":"","keywords":"Management; Library science; Engineering; State (computer science); Art history; Art; Computer science; Programming language","score_opus":0.2553201262360162,"score_gpt":0.38521288592447095,"score_spread":0.12989275968845476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999637374","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.5307932,0.000114926646,0.028693944,0.43410483,0.001190848,0.00044986667,0.00017174153,0.00014396258,0.0043366896],"genre_scores_gemma":[0.8976725,0.000013251283,0.0058642006,0.09580554,0.000256758,0.00000961095,0.00002625747,0.000021471944,0.00033046253],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9960068,0.00023071031,0.00082369405,0.0006324497,0.0019611863,0.0003451476],"domain_scores_gemma":[0.99674296,0.0011425323,0.00033589487,0.0014629497,0.000091474,0.00022416397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001569595,0.00019646742,0.00040626602,0.00013412058,0.00009197363,0.00015712275,0.0027845493,0.00005390397,0.0007582472],"category_scores_gemma":[0.0051126764,0.00016037143,0.00017530035,0.00088657805,0.00023508839,0.0005636432,0.0010216937,0.0001706834,0.0006942341],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000048284313,0.000030200821,0.0010692405,0.000025429323,0.000057055244,0.000039945713,0.0009522394,0.0003250498,0.013894307,0.0012973925,0.97155684,0.010704034],"study_design_scores_gemma":[0.0006608203,0.00014048802,0.0027320755,0.00002581991,0.000041772186,0.0000018509353,0.002555579,0.00026385684,0.0071934755,0.0038108085,0.9821947,0.00037873388],"about_ca_topic_score_codex":0.00028383965,"about_ca_topic_score_gemma":0.000038785503,"teacher_disagreement_score":0.36687925,"about_ca_system_score_codex":0.000030395257,"about_ca_system_score_gemma":0.000053467644,"threshold_uncertainty_score":0.89232063},"labels":[],"label_agreement":null},{"id":"W3161311896","doi":"10.1145/1454497.1454485","title":"Dynamic analysis of Ada programs for comprehension and quality measurement","year":2008,"lang":"en","type":"article","venue":"ACM SIGAda Ada Letters","topic":"Software Engineering Research","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":"Concordia University","funders":"","keywords":"Computer science; Program comprehension; Schema (genetic algorithms); Software engineering; Software quality; Comprehension; Visualization; Programming language; Call graph; Software; Set (abstract data type); Software system; Data mining; Software development; Information retrieval","score_opus":0.08656111550795259,"score_gpt":0.30134099927986446,"score_spread":0.21477988377191187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3161311896","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.66103125,0.00014468821,0.33733588,0.0011038949,0.00006712381,0.00022486222,0.0000023839514,0.00008885073,0.0000010976121],"genre_scores_gemma":[0.9200322,0.000009644943,0.079643086,0.00024672784,0.000008104814,0.000038326813,0.000007873464,0.000009462097,0.000004554766],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9981332,0.00006495492,0.0002875113,0.0003892523,0.0008272492,0.00029786548],"domain_scores_gemma":[0.9980076,0.0007393275,0.00008585261,0.0008950378,0.00017789152,0.00009427462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005836114,0.00013485475,0.0003099048,0.00024298973,0.0000901329,0.000034410594,0.0007498531,0.00003832802,0.0000016859316],"category_scores_gemma":[0.0006184374,0.00012820626,0.00012667244,0.00084743253,0.0000909599,0.0001577117,0.00028313015,0.0001003382,9.118295e-7],"study_design_candidate":"observational","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.00014014289,0.0005127771,0.44170934,0.0007695268,0.0034785797,0.000078240984,0.003405565,0.012779623,0.45522338,0.0005098568,0.0038625528,0.0775304],"study_design_scores_gemma":[0.0010238547,0.000186539,0.91436476,0.00006871318,0.0001580016,0.000009260811,0.000030321311,0.07710755,0.0053868876,0.00008103641,0.0011080542,0.00047503345],"about_ca_topic_score_codex":0.00024302964,"about_ca_topic_score_gemma":0.000067238914,"teacher_disagreement_score":0.4726554,"about_ca_system_score_codex":0.00009822075,"about_ca_system_score_gemma":0.0000410243,"threshold_uncertainty_score":0.52281},"labels":[],"label_agreement":null},{"id":"W4210410570","doi":"10.1145/1879097.1879078","title":"Parallelism generics for Ada 2005 and beyond","year":2010,"lang":"en","type":"article","venue":"ACM SIGAda Ada Letters","topic":"Parallel Computing and Optimization Techniques","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":"General Dynamics (Canada)","funders":"","keywords":"Computer science; Parallelism (grammar); Implicit parallelism; Concurrency; Programming language; Parallel computing; Syntax; Task parallelism; Code (set theory); Artificial intelligence","score_opus":0.011536387084326744,"score_gpt":0.24032613870960468,"score_spread":0.22878975162527793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210410570","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050039556,0.000104938525,0.92210126,0.026315395,0.00056607113,0.00023335264,0.000003368099,0.00041380938,0.00022223123],"genre_scores_gemma":[0.081167586,0.000032256386,0.89824915,0.020130567,0.0002158678,0.00004124712,0.000008063629,0.000018423492,0.0001368542],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988055,0.00002641856,0.00020997149,0.00041540226,0.00018723906,0.00035544668],"domain_scores_gemma":[0.99869853,0.00024279779,0.000098274446,0.0007818799,0.00005356253,0.00012497877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000263836,0.00017047327,0.00016262809,0.000087802895,0.00019492873,0.0001945938,0.0010724565,0.0000850461,0.000006410684],"category_scores_gemma":[0.00013059416,0.00016524752,0.000055701326,0.00014068124,0.00006860389,0.00029015672,0.00035320182,0.0001985062,0.0000048705747],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000019568693,0.00007987157,0.0007965714,0.000049407092,0.00005957115,0.000027955371,0.0009507364,0.0039248466,0.07216945,0.02045305,0.8534945,0.047974445],"study_design_scores_gemma":[0.0018387331,0.00020221384,0.0016095993,0.000033915785,0.000035711157,0.00012043478,0.000034071192,0.33832294,0.02714549,0.017779773,0.611238,0.0016391022],"about_ca_topic_score_codex":0.00002172683,"about_ca_topic_score_gemma":0.000020099089,"teacher_disagreement_score":0.3343981,"about_ca_system_score_codex":0.000013172543,"about_ca_system_score_gemma":0.00003740244,"threshold_uncertainty_score":0.67385983},"labels":[],"label_agreement":null},{"id":"W4233702450","doi":"10.1145/1185875.1185654","title":"Time horizon in distributed object societies","year":2006,"lang":"en","type":"article","venue":"ACM SIGAda Ada Letters","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":"Raytheon Technologies (Canada)","funders":"","keywords":"Event (particle physics); Compendium; Computer science; Software; Modernization theory; Simple (philosophy); Automation; Object (grammar); Aviation; Software engineering; Horizon; Operations research; Engineering; Operating system; Artificial intelligence; Geography; Political science; Archaeology","score_opus":0.0072490915963906105,"score_gpt":0.2025277754509499,"score_spread":0.1952786838545593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233702450","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.8228565,0.00024925556,0.1593885,0.0145771485,0.0007906357,0.0002971006,0.000042557942,0.0006263224,0.0011719738],"genre_scores_gemma":[0.99479985,0.0000015804067,0.0035552739,0.0010117897,0.00024967222,0.000014350505,0.00012404956,0.0000150330525,0.00022842547],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998,0.00013531717,0.00039713611,0.0004915288,0.0004116908,0.0005642893],"domain_scores_gemma":[0.99862254,0.0002772333,0.00013121005,0.0008694503,0.000036989055,0.00006260961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034343745,0.00023989296,0.00028559222,0.00009730793,0.00012314724,0.00025039245,0.0016543724,0.00008837446,0.000010949963],"category_scores_gemma":[0.00006537004,0.00023648469,0.00011857951,0.00067243655,0.00007735481,0.00032126275,0.0003653812,0.00022272598,0.00017879096],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.0000167294,0.00018510017,0.0077792364,0.000074012234,0.000051590418,0.00036873872,0.00054607104,0.028477807,0.030303756,0.0038152493,0.92613876,0.002242953],"study_design_scores_gemma":[0.010899593,0.0012461848,0.20496026,0.0014985232,0.00009627902,0.00045852727,0.0004999933,0.251145,0.018090408,0.03397137,0.46859398,0.008539894],"about_ca_topic_score_codex":0.00035777528,"about_ca_topic_score_gemma":0.000018202867,"teacher_disagreement_score":0.45754477,"about_ca_system_score_codex":0.00013280539,"about_ca_system_score_gemma":0.000056549565,"threshold_uncertainty_score":0.96435654},"labels":[],"label_agreement":null},{"id":"W4236319854","doi":"10.1145/1104011.1103858","title":"AspectAda","year":2005,"lang":"en","type":"article","venue":"ACM SIGAda Ada Letters","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Programming language; Computer science; AspectJ; First-generation programming language; Java; Interface (matter); Low-level programming language; Fourth-generation programming language; Aspect-oriented programming; Very high-level programming language; Programming language specification; Programming paradigm; Programming domain; Functional logic programming; Inductive programming; Software; Operating system","score_opus":0.024166371813279,"score_gpt":0.261369772295011,"score_spread":0.23720340048173202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236319854","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027241087,0.00017526325,0.9489524,0.02191063,0.00051741215,0.00007242558,5.5602413e-7,0.0009835233,0.00014674383],"genre_scores_gemma":[0.113172546,0.000007328924,0.8800277,0.0064471737,0.00023274473,0.000012041626,7.229351e-7,0.000016161412,0.000083572806],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987389,0.000060262584,0.00017850696,0.0003745383,0.00026650477,0.00038128637],"domain_scores_gemma":[0.9977308,0.000893575,0.000053317533,0.0012214681,0.000021901875,0.000078941244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002321879,0.00016986506,0.00016040108,0.00008652895,0.00007342359,0.00007399811,0.0018211863,0.00004262165,0.000014321789],"category_scores_gemma":[0.0010069871,0.00016578162,0.0000612365,0.00028584272,0.000043295124,0.0007022525,0.00048643159,0.00020703924,0.00012061938],"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.000014101373,0.00007590815,0.00086458086,0.00004485654,0.000104508166,0.00031675928,0.0017759507,0.3559233,0.17428498,0.026760543,0.0710957,0.3687388],"study_design_scores_gemma":[0.0026710196,0.0003033557,0.017681763,0.00017646166,0.000045423752,0.00044135106,0.00013545899,0.015235362,0.3104701,0.06653868,0.5818454,0.00445561],"about_ca_topic_score_codex":0.000009219327,"about_ca_topic_score_gemma":0.0000040164414,"teacher_disagreement_score":0.51074976,"about_ca_system_score_codex":0.0000943671,"about_ca_system_score_gemma":0.000021113887,"threshold_uncertainty_score":0.6760378},"labels":[],"label_agreement":null},{"id":"W4246000798","doi":"10.1145/1454497.1454493","title":"Distributed status monitoring and controlusing remote buffers and Ada 2005","year":2008,"lang":"en","type":"article","venue":"ACM SIGAda Ada Letters","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":"General Dynamics (Canada)","funders":"","keywords":"Computer science; Suite; Distributed computing; Interoperability; Implementation; Interface (matter); Multicast; Computer network; Operating system; Software engineering","score_opus":0.01925350179944437,"score_gpt":0.2275272112468763,"score_spread":0.20827370944743193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246000798","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.77843577,0.0009864671,0.21574174,0.0037560917,0.00063078164,0.0001697342,0.000020924614,0.00021874782,0.000039742372],"genre_scores_gemma":[0.9797931,0.000102966005,0.019179452,0.00062875607,0.00023460126,0.0000025112404,0.00001621591,0.000016577018,0.000025869103],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9978696,0.00011615186,0.00033572124,0.0005746623,0.0003730899,0.0007307531],"domain_scores_gemma":[0.99842316,0.00038458372,0.0001519291,0.00069216295,0.000048769976,0.00029938642],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024648462,0.0002734842,0.0003350699,0.00008298227,0.00044175403,0.00026009584,0.0006151776,0.00007552044,0.0000014667105],"category_scores_gemma":[0.00016457918,0.0002712246,0.000051677813,0.00024794566,0.00013596418,0.0004273421,0.0004461832,0.0002381532,0.000005746455],"study_design_candidate":"observational","study_design_consensus":"observational","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.00038870814,0.00029162245,0.5321847,0.0007221405,0.0012646844,0.0060458644,0.014685368,0.021535067,0.16206415,0.0022736285,0.1391655,0.11937852],"study_design_scores_gemma":[0.014258447,0.000575741,0.5649765,0.0016373377,0.00018369006,0.0036194746,0.0007701032,0.19626787,0.0064959894,0.0014331079,0.2043187,0.0054630176],"about_ca_topic_score_codex":0.00066647114,"about_ca_topic_score_gemma":0.0000073781657,"teacher_disagreement_score":0.20135729,"about_ca_system_score_codex":0.00009123006,"about_ca_system_score_gemma":0.000059669303,"threshold_uncertainty_score":0.999974},"labels":[],"label_agreement":null},{"id":"W4249530205","doi":"10.1145/2658982.2527270","title":"Real-time programming on accelerator many-core processors","year":2013,"lang":"en","type":"article","venue":"ACM SIGAda Ada Letters","topic":"Real-Time Systems Scheduling","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":"General Dynamics (Canada)","funders":"","keywords":"Computer science; Concurrency; Correctness; Software development; Programming language; Software; Distributed computing; Programming paradigm; Multi-core processor; Parallel computing","score_opus":0.02073493688878678,"score_gpt":0.24383965326702536,"score_spread":0.2231047163782386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249530205","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.9782706,0.00002255268,0.0056773983,0.012100202,0.000474772,0.0011996981,9.95994e-7,0.0009032692,0.0013505105],"genre_scores_gemma":[0.8387931,0.0000051187053,0.15559892,0.0041057197,0.00045269838,0.000439204,0.000008678836,0.00008601709,0.00051056774],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99653816,0.0001038275,0.00056459126,0.0009910937,0.00086334324,0.0009389711],"domain_scores_gemma":[0.9969336,0.00032465105,0.00030807717,0.0019821664,0.00014593011,0.00030558996],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00039335122,0.00043874676,0.0004121065,0.00021830267,0.00025798255,0.0010082811,0.0030290508,0.00013486341,0.00009232226],"category_scores_gemma":[0.00024602874,0.00039034287,0.00013770928,0.0007167721,0.00007510615,0.0017798374,0.00055573706,0.00034778367,0.00242415],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00002601651,0.00025000342,0.0035402388,0.0003519198,0.00019642874,0.0003610846,0.0034777618,0.0007722045,0.83877826,0.003587107,0.075177886,0.0734811],"study_design_scores_gemma":[0.0140130585,0.0043362384,0.08888663,0.0067540132,0.0003387723,0.0012782458,0.002907084,0.23290163,0.52648634,0.011174959,0.09005856,0.02086446],"about_ca_topic_score_codex":0.00062836974,"about_ca_topic_score_gemma":0.0000036583262,"teacher_disagreement_score":0.3122919,"about_ca_system_score_codex":0.00016061096,"about_ca_system_score_gemma":0.000099431265,"threshold_uncertainty_score":0.99985486},"labels":[],"label_agreement":null},{"id":"W4252757135","doi":"10.1145/1454497.1454487","title":"A buffer container class hierarchy using Ada 2005","year":2008,"lang":"en","type":"article","venue":"ACM SIGAda Ada Letters","topic":"Parallel Computing and Optimization Techniques","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":"General Dynamics (Canada)","funders":"","keywords":"Computer science; Abstraction; Container (type theory); Interface (matter); Set (abstract data type); Notation; Programming language; Implementation; Class (philosophy); Prefix; Class hierarchy; Hierarchy; Object-oriented programming; Operating system","score_opus":0.032939550573299566,"score_gpt":0.2526945720623003,"score_spread":0.21975502148900072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252757135","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.16518334,0.00013356628,0.8242054,0.008936015,0.0002890813,0.00016739611,0.0000013730719,0.00068647164,0.00039735684],"genre_scores_gemma":[0.5172266,0.000027846483,0.46336654,0.018852653,0.00019177013,0.000011974712,0.000004820729,0.00002693563,0.00029089375],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808687,0.0001259905,0.00032312342,0.0005050195,0.00041852065,0.0005404625],"domain_scores_gemma":[0.99836385,0.00020071144,0.00013253932,0.0010752245,0.00007519676,0.0001525012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022022681,0.00024198242,0.00025205404,0.00018478745,0.00033157362,0.00010977823,0.0015446788,0.00008311029,0.000021121858],"category_scores_gemma":[0.000102674836,0.00023412736,0.000105508814,0.00038718403,0.00011774831,0.0004889315,0.0005181188,0.00026013903,0.000028090806],"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.00007337793,0.00030103375,0.011174263,0.000060991795,0.00023128159,0.0014258142,0.0036468871,0.118590266,0.056780588,0.006687693,0.79304004,0.007987794],"study_design_scores_gemma":[0.0022507615,0.00019997876,0.0033810006,0.00019313255,0.000035095578,0.00089190283,0.000044022392,0.8048025,0.023809161,0.0016617256,0.1605076,0.0022231254],"about_ca_topic_score_codex":0.00023429209,"about_ca_topic_score_gemma":0.000007785698,"teacher_disagreement_score":0.68621224,"about_ca_system_score_codex":0.00012324666,"about_ca_system_score_gemma":0.00011383973,"threshold_uncertainty_score":0.9547437},"labels":[],"label_agreement":null},{"id":"W4255323088","doi":"10.1145/2692956.2663181","title":"Safe parallel programming in ada with language extensions","year":2014,"lang":"en","type":"article","venue":"ACM SIGAda Ada Letters","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"General Dynamics (Canada)","funders":"","keywords":"Computer science; Programming language; Concurrency; Compiler; Syntax; Programming paradigm; Parallel programming model; Parallelism (grammar); Parallel computing; Artificial intelligence","score_opus":0.00908914508692225,"score_gpt":0.23240769346300777,"score_spread":0.22331854837608553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255323088","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082462616,0.00005848021,0.90879756,0.0073556565,0.000081126665,0.00021049772,2.952969e-7,0.00054049393,0.00049329776],"genre_scores_gemma":[0.45237815,0.0000031946433,0.5433106,0.0041845627,0.00003784989,0.000023533516,0.0000035040496,0.000012213509,0.000046433437],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850994,0.00011797916,0.00023678136,0.0004447929,0.00028994225,0.00040057325],"domain_scores_gemma":[0.9985722,0.00022706535,0.0001018561,0.00096880354,0.000037475806,0.00009264259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031133223,0.00018602467,0.00020373114,0.00015760014,0.000114536284,0.00013723201,0.0011220317,0.00005122007,0.000004832471],"category_scores_gemma":[0.00014072364,0.00015758979,0.000042391704,0.00047767293,0.00005394684,0.0002824436,0.00030734905,0.00021719986,0.000016109818],"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.00016368831,0.0007567133,0.02969828,0.0001950914,0.00015725856,0.0011921636,0.016326314,0.28310972,0.017043648,0.025436739,0.07510828,0.55081207],"study_design_scores_gemma":[0.007559541,0.0014433865,0.037358385,0.0015821564,0.00006403034,0.00042271,0.00081673346,0.80368924,0.010756558,0.0038269737,0.12738383,0.00509644],"about_ca_topic_score_codex":0.00026209946,"about_ca_topic_score_gemma":0.000089920715,"teacher_disagreement_score":0.54571563,"about_ca_system_score_codex":0.000038757535,"about_ca_system_score_gemma":0.000032410808,"threshold_uncertainty_score":0.64263254},"labels":[],"label_agreement":null},{"id":"W659530620","doi":"10.1145/2870544.2870551","title":"Real-Time Fine-Grained Parallelism in Ada","year":2015,"lang":"en","type":"article","venue":"ACM SIGAda Ada Letters","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"General Dynamics (Canada)","funders":"","keywords":"Computer science; Parallelism (grammar); Task parallelism; Programming language; Parallel computing; Data parallelism; Instruction-level parallelism; Implicit parallelism","score_opus":0.02270847754535184,"score_gpt":0.2530869120129884,"score_spread":0.23037843446763653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W659530620","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30390903,0.00014732742,0.62755775,0.05774041,0.00069358165,0.00059080654,0.0000033691526,0.0025676112,0.0067901127],"genre_scores_gemma":[0.32086805,0.000023555927,0.67139,0.0067938417,0.00017456079,0.000041450185,0.000020020878,0.00003410555,0.00065442635],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981189,0.00015754972,0.00037057887,0.00049923925,0.0004104187,0.00044331286],"domain_scores_gemma":[0.9982722,0.00021128148,0.00012700859,0.001135706,0.000074107076,0.00017972964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005121148,0.0002252553,0.00026730215,0.00021774547,0.000065523986,0.00014343062,0.001847303,0.00008524742,0.000011194049],"category_scores_gemma":[0.0002901506,0.00022298182,0.000067588204,0.00059661857,0.00004962405,0.00041342326,0.0005481153,0.00019933973,0.00010534009],"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.000056384397,0.00018282236,0.0026711489,0.000025873993,0.000045927714,0.00046246694,0.0037377868,0.06609901,0.013495546,0.00489009,0.8990912,0.009241758],"study_design_scores_gemma":[0.007770768,0.0007060601,0.008522437,0.00045000797,0.000033035656,0.00017714468,0.00014165614,0.8577562,0.013924757,0.031462878,0.074999325,0.0040557194],"about_ca_topic_score_codex":0.0005723028,"about_ca_topic_score_gemma":0.000025982701,"teacher_disagreement_score":0.82409185,"about_ca_system_score_codex":0.00011024828,"about_ca_system_score_gemma":0.000106505686,"threshold_uncertainty_score":0.9092935},"labels":[],"label_agreement":null},{"id":"W7119582404","doi":"10.1145/3784987.3784989","title":"Safe UAV Continuous-Control Architecture Design","year":2025,"lang":"en","type":"article","venue":"ACM SIGAda Ada Letters","topic":"Real-Time Systems Scheduling","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":"Process (computing); Formal verification; Model checking; Functional verification; Runtime verification; Formal methods; Architecture; Software; Software verification; Design process","score_opus":0.008503720724271744,"score_gpt":0.22231882235773187,"score_spread":0.21381510163346013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7119582404","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.018586155,0.00023342087,0.9342824,0.043650184,0.0009938194,0.0006062549,0.0000016884073,0.00034914914,0.0012969202],"genre_scores_gemma":[0.73640347,0.0000023534983,0.24107833,0.021772355,0.00020834611,0.000074700714,0.0000017506904,0.000025421865,0.00043327798],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99723417,0.0003913112,0.000492945,0.0007524651,0.00046560384,0.00066353125],"domain_scores_gemma":[0.99645334,0.0012202217,0.00017636745,0.0019461096,0.000071691575,0.0001322669],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007411155,0.0003347248,0.0004560124,0.00026708675,0.00020317768,0.00041613093,0.0029114634,0.000118886244,0.00001617247],"category_scores_gemma":[0.0005116603,0.00030607797,0.00016773671,0.0006367618,0.0000787371,0.00043723817,0.00041236627,0.00039880304,0.00012764],"study_design_candidate":"bench_or_experimental","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.00015333465,0.00013368661,0.0039984123,0.00022755838,0.00070194213,0.00073103205,0.0020844487,0.057044707,0.6530563,0.01352055,0.16917062,0.09917736],"study_design_scores_gemma":[0.03021549,0.0012304328,0.031002928,0.004298858,0.00072435336,0.000992201,0.0007825281,0.21681948,0.30763513,0.06648091,0.32937807,0.01043964],"about_ca_topic_score_codex":0.00017122636,"about_ca_topic_score_gemma":0.000009581603,"teacher_disagreement_score":0.7178173,"about_ca_system_score_codex":0.00010846682,"about_ca_system_score_gemma":0.00015542588,"threshold_uncertainty_score":0.99993914},"labels":[],"label_agreement":null}]}