{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":25,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":25,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"52604394b71c","filters":{"venue":"ACM SIGAda Ada Letters"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Luís Miguel Pinho","is_ca":false},{"name":"Brad Moore","is_ca":true},{"name":"Stephen Michell","is_ca":false},{"name":"S. Tucker Taft","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02270847754535184,"gpt":0.2530869120129884,"spread":0.2303784344676365,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005121148,0.0002252553,0.0002673022,0.0002177455,0.00006552399,0.0001434306,0.001847303,0.00008524742,0.00001119405],"category_scores_gemma":[0.0002901506,0.0002229818,0.0000675882,0.0005966186,0.00004962405,0.0004134233,0.0005481153,0.0001993397,0.0001053401],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001102483,"about_ca_system_score_gemma":0.0001065057,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005723028,"about_ca_topic_score_gemma":0.0000259827,"domain_scores_codex":[0.9981189,0.0001575497,0.0003705789,0.0004992392,0.0004104187,0.0004433129],"domain_scores_gemma":[0.9982722,0.0002112815,0.0001270086,0.001135706,0.00007410708,0.0001797296],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000563844,0.0001828224,0.002671149,0.00002587399,0.00004592771,0.0004624669,0.003737787,0.06609901,0.01349555,0.00489009,0.8990912,0.009241758],"study_design_scores_gemma":[0.007770768,0.0007060601,0.008522437,0.000450008,0.00003303566,0.0001771447,0.0001416561,0.8577562,0.01392476,0.03146288,0.07499932,0.004055719],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.303909,0.0001473274,0.6275578,0.05774041,0.0006935816,0.0005908065,0.000003369153,0.002567611,0.006790113],"genre_scores_gemma":[0.320868,0.00002355593,0.67139,0.006793842,0.0001745608,0.00004145018,0.00002002088,0.00003410555,0.0006544263],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8240919,"threshold_uncertainty_score":0.9092935,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Brad Moore","is_ca":true},{"name":"Stephen Michell","is_ca":false},{"name":"Luís Miguel Pinho","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01202024888399344,"gpt":0.2255274574977706,"spread":0.2135072086137772,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001664078,0.0001620703,0.000169205,0.0001612368,0.00007038079,0.0001945499,0.001693446,0.00006015545,0.00004158608],"category_scores_gemma":[0.00009244365,0.0001561906,0.00005209221,0.0004011894,0.00003631881,0.0005909835,0.0004429642,0.0001937852,0.0001659078],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004947186,"about_ca_system_score_gemma":0.00002800449,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006819274,"about_ca_topic_score_gemma":0.00001455771,"domain_scores_codex":[0.9986362,0.00008113263,0.0002779113,0.0003860713,0.0002488206,0.0003698761],"domain_scores_gemma":[0.9987084,0.000162587,0.00008063873,0.0009231119,0.00004020695,0.00008504243],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009729662,0.0002226725,0.01323684,0.00005008987,0.00005140909,0.000187578,0.003016416,0.04701595,0.01523619,0.0125666,0.8362955,0.07211103],"study_design_scores_gemma":[0.004016687,0.000347881,0.1002411,0.0004747403,0.00001748912,0.0001338543,0.0001825165,0.7258253,0.02056029,0.05981793,0.08419896,0.004183219],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1871935,0.0001212062,0.7722168,0.03741035,0.0003262383,0.0003483561,3.793677e-7,0.0008014766,0.001581714],"genre_scores_gemma":[0.6422933,0.0000163358,0.3431539,0.01427128,0.00005816019,0.00005388252,0.000002618531,0.00001232718,0.0001381973],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7520965,"threshold_uncertainty_score":0.6369269,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"S. Tucker Taft","is_ca":false},{"name":"Brad Moore","is_ca":true},{"name":"Luís Miguel Pinho","is_ca":false},{"name":"Stephen Michell","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00908914508692225,"gpt":0.2324076934630078,"spread":0.2233185483760855,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003113322,0.0001860247,0.0002037311,0.0001576001,0.0001145363,0.000137232,0.001122032,0.00005122007,0.000004832471],"category_scores_gemma":[0.0001407236,0.0001575898,0.0000423917,0.0004776729,0.00005394684,0.0002824436,0.0003073491,0.0002171999,0.00001610982],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003875753,"about_ca_system_score_gemma":0.00003241081,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002620995,"about_ca_topic_score_gemma":0.00008992072,"domain_scores_codex":[0.9985099,0.0001179792,0.0002367814,0.0004447929,0.0002899423,0.0004005732],"domain_scores_gemma":[0.9985722,0.0002270653,0.0001018561,0.0009688035,0.00003747581,0.00009264259],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001636883,0.0007567133,0.02969828,0.0001950914,0.0001572586,0.001192164,0.01632631,0.2831097,0.01704365,0.02543674,0.07510828,0.5508121],"study_design_scores_gemma":[0.007559541,0.001443387,0.03735838,0.001582156,0.00006403034,0.00042271,0.0008167335,0.8036892,0.01075656,0.003826974,0.1273838,0.00509644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08246262,0.00005848021,0.9087976,0.007355656,0.00008112667,0.0002104977,2.952969e-7,0.0005404939,0.0004932978],"genre_scores_gemma":[0.4523782,0.000003194643,0.5433106,0.004184563,0.00003784989,0.00002353352,0.00000350405,0.00001221351,0.00004643344],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5457156,"threshold_uncertainty_score":0.6426325,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Knut H. Pedersen","is_ca":true},{"name":"Constantinos Constantinides","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.024166371813279,"gpt":0.261369772295011,"spread":0.237203400481732,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002321879,0.0001698651,0.0001604011,0.00008652895,0.00007342359,0.00007399811,0.001821186,0.00004262165,0.00001432179],"category_scores_gemma":[0.001006987,0.0001657816,0.0000612365,0.0002858427,0.00004329512,0.0007022525,0.0004864316,0.0002070392,0.0001206194],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000943671,"about_ca_system_score_gemma":0.00002111389,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009219327,"about_ca_topic_score_gemma":0.000004016441,"domain_scores_codex":[0.9987389,0.00006026258,0.000178507,0.0003745383,0.0002665048,0.0003812864],"domain_scores_gemma":[0.9977308,0.000893575,0.00005331753,0.001221468,0.00002190187,0.00007894124],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001410137,0.00007590815,0.0008645809,0.00004485654,0.0001045082,0.0003167593,0.001775951,0.3559233,0.174285,0.02676054,0.0710957,0.3687388],"study_design_scores_gemma":[0.00267102,0.0003033557,0.01768176,0.0001764617,0.00004542375,0.0004413511,0.000135459,0.01523536,0.3104701,0.06653868,0.5818454,0.00445561],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02724109,0.0001752633,0.9489524,0.02191063,0.0005174121,0.00007242558,5.560241e-7,0.0009835233,0.0001467438],"genre_scores_gemma":[0.1131725,0.000007328924,0.8800277,0.006447174,0.0002327447,0.00001204163,7.229351e-7,0.00001616141,0.00008357281],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5107498,"threshold_uncertainty_score":0.6760378,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Stephen Michell","is_ca":false},{"name":"Luke Wong","is_ca":false},{"name":"Brad Moore","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007968287309009604,"gpt":0.220578211781564,"spread":0.2126099244725544,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006970435,0.0003832393,0.0003952115,0.0002073656,0.0002511248,0.0005206787,0.003527573,0.0001736512,0.0001058867],"category_scores_gemma":[0.0004091928,0.0003653925,0.0001662721,0.0004648796,0.0001125362,0.001314026,0.00063245,0.0006980103,0.0008442432],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007846719,"about_ca_system_score_gemma":0.0001705607,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002898742,"about_ca_topic_score_gemma":0.0003036406,"domain_scores_codex":[0.9967495,0.0001325323,0.0005718599,0.000844678,0.0007343064,0.000967118],"domain_scores_gemma":[0.9958075,0.0004892765,0.0002738943,0.0029366,0.00009023889,0.0004025416],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001756208,0.00006026042,0.001008941,0.00003924414,0.00007648388,0.0002204635,0.001036244,0.0002861427,0.9035988,0.004288259,0.08333225,0.006035368],"study_design_scores_gemma":[0.008905045,0.0007872133,0.04334097,0.0007870721,0.0002100936,0.002833399,0.001380016,0.06744458,0.3231269,0.005084104,0.5363299,0.00977069],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8998053,0.00006117779,0.02280053,0.07103992,0.003035577,0.0004886958,0.000005973877,0.0006343033,0.002128527],"genre_scores_gemma":[0.8693323,0.000004059682,0.1138681,0.01553266,0.0007754508,0.00004262603,0.00001414554,0.00005821603,0.000372497],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5804719,"threshold_uncertainty_score":0.9999337,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Citation; Computer science; Software; Library science; World Wide Web; Operating system","authors":[{"name":"Stephen Michell","is_ca":false},{"name":"Jorge Real","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008741895914681243,"gpt":0.2365375849585324,"spread":0.2277956890438511,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004897402,0.0001982227,0.0002385722,0.00009805844,0.0001908879,0.0001575009,0.004591984,0.0001009764,0.0001182962],"category_scores_gemma":[0.0006312628,0.0001489814,0.0001631183,0.0004177529,0.0001586149,0.0005466299,0.001826032,0.0004330637,0.00009027577],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005186603,"about_ca_system_score_gemma":0.0001249495,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004396841,"about_ca_topic_score_gemma":0.00005588384,"domain_scores_codex":[0.997906,0.0001166142,0.000447695,0.0004352501,0.0007608698,0.000333578],"domain_scores_gemma":[0.9967062,0.0007191184,0.0003159099,0.002027284,0.0001214688,0.0001100251],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000005701811,0.00003477386,0.002153589,0.000009339718,0.00006034164,0.00002558348,0.0008339973,0.0004176518,0.9669107,0.00287577,0.02370251,0.002969997],"study_design_scores_gemma":[0.008053772,0.0002920192,0.1142473,0.002088997,0.0002628279,0.001530965,0.001527323,0.1662088,0.4708959,0.007841158,0.2211831,0.005867826],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9293231,0.000008247948,0.01105364,0.04921604,0.004417514,0.0003193974,0.000006401689,0.0001630234,0.005492589],"genre_scores_gemma":[0.947266,0.000004213625,0.05017957,0.001706914,0.0004046278,0.00001702344,0.000003862614,0.00002227881,0.0003954527],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4960149,"threshold_uncertainty_score":0.8533124,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Judith Klein","is_ca":false},{"name":"Drasko Sotirovski","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00727781898003395,"gpt":0.2071256663101589,"spread":0.199847847330125,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000203272,0.0001977248,0.0002061625,0.00006824607,0.0001357506,0.0006713879,0.002132378,0.0001038748,0.0000265024],"category_scores_gemma":[0.0001238722,0.0001829668,0.00009945621,0.0005533284,0.00005007359,0.000970176,0.0003125049,0.0002581791,0.0001592429],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005605511,"about_ca_system_score_gemma":0.00003279852,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004476251,"about_ca_topic_score_gemma":0.00001946724,"domain_scores_codex":[0.9981806,0.00005263364,0.0003154605,0.000494737,0.0004730823,0.0004835081],"domain_scores_gemma":[0.9980754,0.0001817996,0.0001147879,0.001477919,0.00005635134,0.00009379867],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000002687199,0.00004688861,0.003683945,0.00001507732,0.0000162386,0.0001068024,0.00008964171,0.0003135291,0.001848986,0.05091257,0.9389979,0.003965685],"study_design_scores_gemma":[0.0007083482,0.00004784055,0.03004822,0.0001812002,0.00001189548,0.00006060286,0.00003509605,0.001768751,0.0006927581,0.05020287,0.9151877,0.001054695],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06336344,0.0003288409,0.8747323,0.05104873,0.003283682,0.0002139738,0.000006701849,0.0005143039,0.006508036],"genre_scores_gemma":[0.9239619,0.000001576765,0.06241959,0.01238195,0.0005387181,0.00003185057,0.00001503771,0.00002054951,0.0006287635],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8605985,"threshold_uncertainty_score":0.7461172,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Douglas J. Howe","is_ca":true},{"name":"Stephen Michell","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03251390474002544,"gpt":0.2853511344025492,"spread":0.2528372296625238,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007508374,0.0001689667,0.0001948285,0.0001022174,0.00008745038,0.0000820596,0.001492801,0.00005731363,0.0000047338],"category_scores_gemma":[0.0001765328,0.0001664434,0.00005644222,0.0005958413,0.00007017516,0.001073816,0.0001455325,0.0001211497,0.00003333602],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008955302,"about_ca_system_score_gemma":0.00005878828,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005500361,"about_ca_topic_score_gemma":7.076168e-7,"domain_scores_codex":[0.9981279,0.0002372446,0.0003650068,0.0004376146,0.0004517936,0.0003804766],"domain_scores_gemma":[0.9981323,0.00006060481,0.0001975045,0.001367292,0.00008932621,0.000152915],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0000503592,0.0009960321,0.002373922,0.0001508605,0.00006883803,0.000004878892,0.005668013,0.002397253,0.332673,0.2401644,0.003054497,0.4123979],"study_design_scores_gemma":[0.004430561,0.004003466,0.05973578,0.0002788738,0.0001535906,0.0001898289,0.0009515446,0.3464692,0.5072171,0.003778915,0.06831022,0.004480892],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2446761,0.00001031945,0.7522797,0.0003426937,0.0002800121,0.0004668139,0.000001732673,0.000143689,0.001798975],"genre_scores_gemma":[0.4245815,0.000001747119,0.574837,0.000451372,0.00002804599,0.00006616468,0.00001493833,0.00001022641,0.000008909559],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.407917,"threshold_uncertainty_score":0.6787364,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Elaheh Safari-Sharifabadi","is_ca":true},{"name":"Constantinos Constantinides","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08656111550795259,"gpt":0.3013409992798645,"spread":0.2147798837719119,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005836114,0.0001348548,0.0003099048,0.0002429897,0.0000901329,0.00003441059,0.0007498531,0.00003832802,0.000001685932],"category_scores_gemma":[0.0006184374,0.0001282063,0.0001266724,0.0008474325,0.0000909599,0.0001577117,0.0002831302,0.0001003382,9.118295e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009822075,"about_ca_system_score_gemma":0.0000410243,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002430296,"about_ca_topic_score_gemma":0.00006723891,"domain_scores_codex":[0.9981332,0.00006495492,0.0002875113,0.0003892523,0.0008272492,0.0002978655],"domain_scores_gemma":[0.9980076,0.0007393275,0.00008585261,0.0008950378,0.0001778915,0.00009427462],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","study_design_scores_codex":[0.0001401429,0.0005127771,0.4417093,0.0007695268,0.00347858,0.00007824098,0.003405565,0.01277962,0.4552234,0.0005098568,0.003862553,0.0775304],"study_design_scores_gemma":[0.001023855,0.000186539,0.9143648,0.00006871318,0.0001580016,0.000009260811,0.00003032131,0.07710755,0.005386888,0.00008103641,0.001108054,0.0004750334],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6610312,0.0001446882,0.3373359,0.001103895,0.00006712381,0.0002248622,0.000002383951,0.00008885073,0.000001097612],"genre_scores_gemma":[0.9200322,0.000009644943,0.07964309,0.0002467278,0.000008104814,0.00003832681,0.000007873464,0.000009462097,0.000004554766],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4726554,"threshold_uncertainty_score":0.52281,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Tucker Taft","is_ca":false},{"name":"Brad Moore","is_ca":true},{"name":"Luís Miguel Pinho","is_ca":false},{"name":"Stephen Michell","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0331962137927896,"gpt":0.274088169665274,"spread":0.2408919558724844,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004986876,0.0001440637,0.000175422,0.0001318188,0.00008805846,0.00004731571,0.001189331,0.00005689208,9.120535e-7],"category_scores_gemma":[0.0001135606,0.0000944416,0.00008280238,0.0002708821,0.00006508774,0.0003721919,0.0001258339,0.00007898348,0.000002223797],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004715365,"about_ca_system_score_gemma":0.00004596588,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004225205,"about_ca_topic_score_gemma":0.000006581794,"domain_scores_codex":[0.9986529,0.0001110263,0.0003721782,0.0003350061,0.0002783281,0.0002505378],"domain_scores_gemma":[0.9986831,0.0003968352,0.0002054393,0.0006040967,0.00007950397,0.00003102458],"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.00005759543,0.00009925979,0.0001893132,0.00003347726,0.00002122155,0.000002868427,0.002285468,0.9163006,0.009391194,0.01007023,0.0416255,0.0199233],"study_design_scores_gemma":[0.0008812915,0.00007704463,0.0004113549,0.00007426208,0.000006527691,0.00001078154,0.0000358005,0.9778638,0.001137848,0.01898741,0.0002902525,0.0002235799],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02396008,0.00003300275,0.9542017,0.02111779,0.0001160077,0.0003823393,0.000002464345,0.0001368519,0.00004978518],"genre_scores_gemma":[0.5413595,0.00001338871,0.4574126,0.001091229,0.00003225623,0.00005241759,0.000003482849,0.000007276077,0.00002778963],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5173995,"threshold_uncertainty_score":0.3851216,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"General Dynamics (Canada)","funders":"","keywords":"Computer science; Simple (philosophy); Memory management; Programming language; Distributed computing; Operating system; Semiconductor memory","authors":[{"name":"Luke Wong","is_ca":false},{"name":"Stephen Michell","is_ca":false},{"name":"Brad Moore","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01178120214542567,"gpt":0.2382128219669543,"spread":0.2264316198215286,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006230882,0.0002664255,0.0002985804,0.000130248,0.000201207,0.0003149176,0.002755664,0.0001236981,0.00002978638],"category_scores_gemma":[0.0006422608,0.0002538137,0.0001675396,0.000285452,0.0000731753,0.0008413569,0.0004428756,0.000377163,0.0001450166],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005004996,"about_ca_system_score_gemma":0.0001112037,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002694151,"about_ca_topic_score_gemma":0.00007365178,"domain_scores_codex":[0.997742,0.00006678593,0.0004055507,0.000671278,0.0004888659,0.0006255246],"domain_scores_gemma":[0.9967599,0.0007048748,0.0001937269,0.002044098,0.00009147047,0.0002059352],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00001492784,0.00003595011,0.0003483115,0.00007700664,0.0000671677,0.00006862749,0.0007931315,0.0003030901,0.9277902,0.002401682,0.04981479,0.01828516],"study_design_scores_gemma":[0.008195132,0.0005229335,0.008604145,0.0004228055,0.0001510001,0.0007743143,0.0006540926,0.1016877,0.6607291,0.007795598,0.2052803,0.005182973],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7071075,0.00004481944,0.2574212,0.02952958,0.004069098,0.0008295623,0.000004854262,0.0004479519,0.0005455022],"genre_scores_gemma":[0.7809214,7.745277e-7,0.2109603,0.007067344,0.0006435928,0.0001261647,0.000005510365,0.00003867744,0.0002362998],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2670611,"threshold_uncertainty_score":0.9999914,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Luís Miguel Pinho","is_ca":false},{"name":"Stephen Michell","is_ca":false},{"name":"Brad Moore","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01769208592258515,"gpt":0.2284198450471966,"spread":0.2107277591246114,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001147024,0.0001605846,0.0001456777,0.00009429128,0.0001422843,0.0002361276,0.001047992,0.00005504032,0.00002358637],"category_scores_gemma":[0.00005797472,0.0001376909,0.00003769924,0.0002045042,0.00005565457,0.0006572111,0.0005326035,0.0001480401,0.00006483755],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002397378,"about_ca_system_score_gemma":0.00001650216,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001718593,"about_ca_topic_score_gemma":0.000002227869,"domain_scores_codex":[0.998919,0.00001226989,0.000196187,0.0003541696,0.0002198263,0.0002986109],"domain_scores_gemma":[0.9989091,0.000126883,0.00008105383,0.0007316883,0.00004142171,0.0001098079],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001312767,0.0001187631,0.02053505,0.0001139994,0.0001234644,0.0001206941,0.003119362,0.004739953,0.02341188,0.03937615,0.7733424,0.1349852],"study_design_scores_gemma":[0.003022284,0.0005717737,0.06311069,0.000410959,0.0000412741,0.0003896894,0.0002468514,0.7488754,0.03580187,0.1023947,0.04120025,0.003934212],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4008055,0.00008212449,0.589713,0.007928815,0.0001716828,0.0001979247,4.768551e-7,0.0006048234,0.0004956711],"genre_scores_gemma":[0.6564906,0.00002019317,0.3319327,0.01130513,0.00006327029,0.00002537689,0.000002942139,0.00001283344,0.0001470059],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7441354,"threshold_uncertainty_score":0.5614871,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Drasko Sotirovski","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007249091596390611,"gpt":0.2025277754509499,"spread":0.1952786838545593,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003434375,0.000239893,0.0002855922,0.00009730793,0.0001231472,0.0002503924,0.001654372,0.00008837446,0.00001094996],"category_scores_gemma":[0.00006537004,0.0002364847,0.0001185795,0.0006724366,0.00007735481,0.0003212627,0.0003653812,0.000222726,0.000178791],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001328054,"about_ca_system_score_gemma":0.00005654956,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003577753,"about_ca_topic_score_gemma":0.00001820287,"domain_scores_codex":[0.998,0.0001353172,0.0003971361,0.0004915288,0.0004116908,0.0005642893],"domain_scores_gemma":[0.9986225,0.0002772333,0.0001312101,0.0008694503,0.00003698905,0.00006260961],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0000167294,0.0001851002,0.007779236,0.00007401223,0.00005159042,0.0003687387,0.000546071,0.02847781,0.03030376,0.003815249,0.9261388,0.002242953],"study_design_scores_gemma":[0.01089959,0.001246185,0.2049603,0.001498523,0.00009627902,0.0004585273,0.0004999933,0.251145,0.01809041,0.03397137,0.468594,0.008539894],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8228565,0.0002492556,0.1593885,0.01457715,0.0007906357,0.0002971006,0.00004255794,0.0006263224,0.001171974],"genre_scores_gemma":[0.9947999,0.000001580407,0.003555274,0.00101179,0.0002496722,0.0000143505,0.0001240496,0.00001503305,0.0002284255],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4575448,"threshold_uncertainty_score":0.9643565,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Bradley S. Moore","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02888066258292444,"gpt":0.2236974589418251,"spread":0.1948167963589007,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002146005,0.0002193279,0.0001934289,0.0001176926,0.0001573586,0.00009581616,0.001721974,0.00006402549,0.00003553892],"category_scores_gemma":[0.00005840958,0.0001820786,0.0000551423,0.0003774952,0.00007193453,0.0004611856,0.0003577861,0.0001905758,0.00006578206],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004103746,"about_ca_system_score_gemma":0.00004662064,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001098208,"about_ca_topic_score_gemma":0.000009170442,"domain_scores_codex":[0.9984381,0.00009469804,0.0002458599,0.000496763,0.0003349918,0.0003896467],"domain_scores_gemma":[0.9983332,0.0001232545,0.0001491018,0.001209576,0.00006389982,0.0001209632],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0007206202,0.001057823,0.0168945,0.000169903,0.0004124368,0.001139556,0.02025821,0.04347822,0.007190565,0.05368891,0.7527745,0.1022147],"study_design_scores_gemma":[0.01561709,0.00726477,0.06386962,0.002257279,0.0002560141,0.00106709,0.0007984747,0.2980387,0.1742258,0.04810448,0.3734464,0.01505424],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03708861,0.00006057974,0.9552073,0.004019258,0.000156476,0.0001961801,8.462555e-7,0.0007769904,0.002493774],"genre_scores_gemma":[0.2543473,0.00002256031,0.7404276,0.004967555,0.00003970309,0.00001770628,0.000003816137,0.00001748921,0.0001562456],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3793282,"threshold_uncertainty_score":0.7424949,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Jean-Pierre Rosen","is_ca":false},{"name":"Brad Moore","is_ca":true},{"name":"Tucker Taft","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03229160905340734,"gpt":0.253286128761819,"spread":0.2209945197084117,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018144,0.0001213881,0.0001175189,0.00003716869,0.0003003077,0.0001059862,0.0005728761,0.00007248238,0.0003696148],"category_scores_gemma":[0.0003561977,0.0001009521,0.00007531413,0.0002342284,0.0001102707,0.0003366838,0.00009719939,0.0001139099,0.0002760985],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007992492,"about_ca_system_score_gemma":0.00003529827,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008590459,"about_ca_topic_score_gemma":0.008134302,"domain_scores_codex":[0.9987519,0.00009339306,0.0001089764,0.0002463083,0.0003805702,0.00041887],"domain_scores_gemma":[0.9993553,0.00004246323,0.00005160367,0.0003344737,0.00004210861,0.0001740761],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00008324561,0.00009084104,0.007267031,0.00002100623,0.00009317496,0.0002762737,0.1569005,0.000004905319,0.098781,0.009052366,0.6795838,0.04784591],"study_design_scores_gemma":[0.0003566248,0.00008735466,0.01588445,0.00003989791,0.00004103647,0.000004019354,0.0173369,0.0000013673,0.006035045,0.00134396,0.95826,0.0006093381],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9144961,0.0001033572,0.0001762734,0.07219303,0.0006292945,0.0002836713,0.000005191058,0.0001673324,0.01194576],"genre_scores_gemma":[0.968851,0.000009802538,0.0024737,0.01858341,0.0005860227,0.00002353595,0.000005874443,0.00001307072,0.009453582],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2786762,"threshold_uncertainty_score":0.9980114,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Stephen Michell","is_ca":false},{"name":"Brad Moore","is_ca":true},{"name":"Luís Miguel Pinho","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02073493688878678,"gpt":0.2438396532670254,"spread":0.2231047163782386,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003933512,0.0004387468,0.0004121065,0.0002183027,0.0002579826,0.001008281,0.003029051,0.0001348634,0.00009232226],"category_scores_gemma":[0.0002460287,0.0003903429,0.0001377093,0.0007167721,0.00007510615,0.001779837,0.0005557371,0.0003477837,0.00242415],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000160611,"about_ca_system_score_gemma":0.00009943126,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006283697,"about_ca_topic_score_gemma":0.000003658326,"domain_scores_codex":[0.9965382,0.0001038275,0.0005645913,0.0009910937,0.0008633432,0.0009389711],"domain_scores_gemma":[0.9969336,0.000324651,0.0003080772,0.001982166,0.0001459301,0.00030559],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00002601651,0.0002500034,0.003540239,0.0003519198,0.0001964287,0.0003610846,0.003477762,0.0007722045,0.8387783,0.003587107,0.07517789,0.0734811],"study_design_scores_gemma":[0.01401306,0.004336238,0.08888663,0.006754013,0.0003387723,0.001278246,0.002907084,0.2329016,0.5264863,0.01117496,0.09005856,0.02086446],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9782706,0.00002255268,0.005677398,0.0121002,0.000474772,0.001199698,9.95994e-7,0.0009032692,0.001350511],"genre_scores_gemma":[0.8387931,0.000005118705,0.1555989,0.00410572,0.0004526984,0.000439204,0.000008678836,0.00008601709,0.0005105677],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3122919,"threshold_uncertainty_score":0.9998549,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Jason Belt","is_ca":false},{"name":"John Hatcliff","is_ca":false},{"name":"Robby","is_ca":false},{"name":"Patrice Chalin","is_ca":true},{"name":"David Hardin","is_ca":false},{"name":"Xianghua Deng","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06601541650421534,"gpt":0.2562466960245205,"spread":0.1902312795203052,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004274587,0.0002322444,0.0002369738,0.0001618429,0.0002311758,0.0001537665,0.001129902,0.00007785767,0.00001645273],"category_scores_gemma":[0.0006658025,0.0002353335,0.00008849719,0.0002667883,0.00008096747,0.0006870411,0.0003569728,0.0002240853,0.00001649797],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001108538,"about_ca_system_score_gemma":0.00005834852,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002534472,"about_ca_topic_score_gemma":0.0000192405,"domain_scores_codex":[0.9983309,0.00008130987,0.0003205443,0.0004564108,0.0003170657,0.0004938057],"domain_scores_gemma":[0.9983162,0.0003672179,0.0001606518,0.001000208,0.00006111559,0.00009460219],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00006784341,0.0002793124,0.06071586,0.0003747757,0.0002516285,0.0008546796,0.05269439,0.0003116131,0.8082952,0.008330189,0.01831818,0.0495063],"study_design_scores_gemma":[0.001228695,0.0003122605,0.03805285,0.001617564,0.0001034061,0.0006850293,0.0003126153,0.03913156,0.8567352,0.05570467,0.002881142,0.003235026],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5225955,0.00007852902,0.4722466,0.0003226624,0.0003216614,0.0001093473,0.000001216757,0.004124087,0.0002004109],"genre_scores_gemma":[0.7346786,0.000002133751,0.2635339,0.001669248,0.00007775585,0.0000109367,0.000001140761,0.00001459841,0.00001171913],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2120831,"threshold_uncertainty_score":0.9596623,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Brad Moore","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03293955057329957,"gpt":0.2526945720623003,"spread":0.2197550214890007,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002202268,0.0002419824,0.000252054,0.0001847875,0.0003315736,0.0001097782,0.001544679,0.00008311029,0.00002112186],"category_scores_gemma":[0.0001026748,0.0002341274,0.0001055088,0.000387184,0.0001177483,0.0004889315,0.0005181188,0.000260139,0.00002809081],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001232467,"about_ca_system_score_gemma":0.0001138397,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002342921,"about_ca_topic_score_gemma":0.000007785698,"domain_scores_codex":[0.9980869,0.0001259905,0.0003231234,0.0005050195,0.0004185206,0.0005404625],"domain_scores_gemma":[0.9983639,0.0002007114,0.0001325393,0.001075224,0.00007519676,0.0001525012],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007337793,0.0003010338,0.01117426,0.0000609918,0.0002312816,0.001425814,0.003646887,0.1185903,0.05678059,0.006687693,0.79304,0.007987794],"study_design_scores_gemma":[0.002250761,0.0001999788,0.003381001,0.0001931326,0.00003509558,0.0008919028,0.00004402239,0.8048025,0.02380916,0.001661726,0.1605076,0.002223125],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1651833,0.0001335663,0.8242054,0.008936015,0.0002890813,0.0001673961,0.000001373072,0.0006864716,0.0003973568],"genre_scores_gemma":[0.5172266,0.00002784648,0.4633665,0.01885265,0.0001917701,0.00001197471,0.000004820729,0.00002693563,0.0002908937],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6862122,"threshold_uncertainty_score":0.9547437,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"General Dynamics (Canada)","funders":"","keywords":"Management; Library science; Engineering; State (computer science); Art history; Art; Computer science; Programming language","authors":[{"name":"Brad Moore","is_ca":true},{"name":"John A. Hamilton","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2553201262360162,"gpt":0.3852128859244709,"spread":0.1298927596884548,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001569595,0.0001964674,0.000406266,0.0001341206,0.00009197363,0.0001571227,0.002784549,0.00005390397,0.0007582472],"category_scores_gemma":[0.005112676,0.0001603714,0.0001753003,0.0008865781,0.0002350884,0.0005636432,0.001021694,0.0001706834,0.0006942341],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003039526,"about_ca_system_score_gemma":0.00005346764,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002838396,"about_ca_topic_score_gemma":0.0000387855,"domain_scores_codex":[0.9960068,0.0002307103,0.000823694,0.0006324497,0.001961186,0.0003451476],"domain_scores_gemma":[0.996743,0.001142532,0.0003358949,0.00146295,0.000091474,0.000224164],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00004828431,0.00003020082,0.001069241,0.00002542932,0.00005705524,0.00003994571,0.0009522394,0.0003250498,0.01389431,0.001297393,0.9715568,0.01070403],"study_design_scores_gemma":[0.0006608203,0.000140488,0.002732076,0.00002581991,0.00004177219,0.000001850935,0.002555579,0.0002638568,0.007193475,0.003810809,0.9821947,0.0003787339],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5307932,0.0001149266,0.02869394,0.4341048,0.001190848,0.0004498667,0.0001717415,0.0001439626,0.00433669],"genre_scores_gemma":[0.8976725,0.00001325128,0.005864201,0.09580554,0.000256758,0.00000961095,0.00002625747,0.00002147194,0.0003304625],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3668793,"threshold_uncertainty_score":0.8923206,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Apache (Canada)","funders":"","keywords":"Computer science; Variety (cybernetics); Component (thermodynamics); Software engineering; Artificial intelligence","authors":[{"name":"Jeffrey R. Carter","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01552825387454623,"gpt":0.2205371616111231,"spread":0.2050089077365768,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004253808,0.0001880394,0.000165028,0.00003628449,0.0005582431,0.0004889598,0.003355854,0.00004530908,0.000002279907],"category_scores_gemma":[0.0001398397,0.0001371981,0.0000880706,0.0003617891,0.00007590554,0.0002991075,0.0006138898,0.0002127438,0.0002155189],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001020082,"about_ca_system_score_gemma":0.00006746226,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003739109,"about_ca_topic_score_gemma":0.00002051658,"domain_scores_codex":[0.9981828,0.00009680421,0.0003059478,0.0003941029,0.0004899164,0.000530367],"domain_scores_gemma":[0.9977474,0.000346772,0.0001407903,0.001606222,0.00004623865,0.0001125935],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00007568306,0.0004449768,0.006392963,0.0001454232,0.0005303473,0.001050875,0.00382885,0.1314086,0.06805813,0.2062757,0.5645596,0.01722888],"study_design_scores_gemma":[0.002907271,0.0001827109,0.01060161,0.0003306586,0.000022732,0.0002981326,0.00010711,0.006579838,0.004030805,0.02013198,0.9534782,0.001329025],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4207976,0.0003950532,0.4698789,0.1027756,0.003332223,0.0004393547,0.000005792929,0.0006214825,0.001754011],"genre_scores_gemma":[0.9842249,0.000006782006,0.01075198,0.004635347,0.0001859396,0.00001419,0.000009132418,0.0000130862,0.0001586416],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5634273,"threshold_uncertainty_score":0.6236068,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Brad Moore","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01925350179944437,"gpt":0.2275272112468763,"spread":0.2082737094474319,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002464846,0.0002734842,0.0003350699,0.00008298227,0.000441754,0.0002600958,0.0006151776,0.00007552044,0.000001466711],"category_scores_gemma":[0.0001645792,0.0002712246,0.00005167781,0.0002479457,0.0001359642,0.0004273421,0.0004461832,0.0002381532,0.000005746455],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009123006,"about_ca_system_score_gemma":0.0000596693,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006664711,"about_ca_topic_score_gemma":0.000007378166,"domain_scores_codex":[0.9978696,0.0001161519,0.0003357212,0.0005746623,0.0003730899,0.0007307531],"domain_scores_gemma":[0.9984232,0.0003845837,0.0001519291,0.000692163,0.00004876998,0.0002993864],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.0003887081,0.0002916224,0.5321847,0.0007221405,0.001264684,0.006045864,0.01468537,0.02153507,0.1620641,0.002273628,0.1391655,0.1193785],"study_design_scores_gemma":[0.01425845,0.000575741,0.5649765,0.001637338,0.0001836901,0.003619475,0.0007701032,0.1962679,0.006495989,0.001433108,0.2043187,0.005463018],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7784358,0.0009864671,0.2157417,0.003756092,0.0006307816,0.0001697342,0.00002092461,0.0002187478,0.00003974237],"genre_scores_gemma":[0.9797931,0.000102966,0.01917945,0.0006287561,0.0002346013,0.00000251124,0.00001621591,0.00001657702,0.0000258691],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2013573,"threshold_uncertainty_score":0.999974,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"L. B. Becker","is_ca":false},{"name":"E. F. Broering","is_ca":false},{"name":"F. S. Gonçalves","is_ca":false},{"name":"H. A. Misson","is_ca":true},{"name":"L. Cordeiro","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008503720724271744,"gpt":0.2223188223577319,"spread":0.2138151016334601,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007411155,0.0003347248,0.0004560124,0.0002670868,0.0002031777,0.0004161309,0.002911463,0.0001188862,0.00001617247],"category_scores_gemma":[0.0005116603,0.000306078,0.0001677367,0.0006367618,0.0000787371,0.0004372382,0.0004123663,0.000398803,0.00012764],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001084668,"about_ca_system_score_gemma":0.0001554259,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001712264,"about_ca_topic_score_gemma":0.000009581603,"domain_scores_codex":[0.9972342,0.0003913112,0.000492945,0.0007524651,0.0004656038,0.0006635312],"domain_scores_gemma":[0.9964533,0.001220222,0.0001763675,0.00194611,0.00007169157,0.0001322669],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001533347,0.0001336866,0.003998412,0.0002275584,0.0007019421,0.0007310321,0.002084449,0.05704471,0.6530563,0.01352055,0.1691706,0.09917736],"study_design_scores_gemma":[0.03021549,0.001230433,0.03100293,0.004298858,0.0007243534,0.000992201,0.0007825281,0.2168195,0.3076351,0.06648091,0.3293781,0.01043964],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01858616,0.0002334209,0.9342824,0.04365018,0.0009938194,0.0006062549,0.000001688407,0.0003491491,0.00129692],"genre_scores_gemma":[0.7364035,0.000002353498,0.2410783,0.02177235,0.0002083461,0.00007470071,0.00000175069,0.00002542186,0.000433278],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7178173,"threshold_uncertainty_score":0.9999391,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Brad Moore","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01215564041353887,"gpt":0.2366414925190289,"spread":0.2244858521054901,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002206112,0.0001769263,0.0001990635,0.00005869037,0.0001829961,0.0002280101,0.001978182,0.0000548776,0.00005895329],"category_scores_gemma":[0.00008530767,0.0001619941,0.00007564522,0.0003673384,0.0001132961,0.0004761609,0.0003362457,0.0001167178,0.0006661675],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005400431,"about_ca_system_score_gemma":0.0000462192,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001104346,"about_ca_topic_score_gemma":0.00001321697,"domain_scores_codex":[0.9984092,0.00005762322,0.0002670565,0.0004626267,0.0003572167,0.0004462901],"domain_scores_gemma":[0.9982533,0.0001147727,0.0001042598,0.001320687,0.00008051092,0.0001264919],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002106808,0.0001446137,0.002001098,0.00006657089,0.0001459764,0.0004216619,0.00190199,0.0002290916,0.2063422,0.01340494,0.706465,0.06885584],"study_design_scores_gemma":[0.002083652,0.0006291753,0.01145562,0.0003849078,0.00003272401,0.000280434,0.00012878,0.01971985,0.06471232,0.003483435,0.8948491,0.002240013],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2203232,0.0001893027,0.7564837,0.01828956,0.001648603,0.0002302587,0.00001151559,0.0004082911,0.002415583],"genre_scores_gemma":[0.9744487,0.000002058708,0.01403324,0.01084161,0.0005169249,0.00001727083,0.000003694854,0.0000125624,0.0001238725],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7541255,"threshold_uncertainty_score":0.8562458,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Brad Moore","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01153638708432674,"gpt":0.2403261387096047,"spread":0.2287897516252779,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000263836,0.0001704733,0.0001626281,0.00008780289,0.0001949287,0.0001945938,0.001072456,0.0000850461,0.000006410684],"category_scores_gemma":[0.0001305942,0.0001652475,0.00005570133,0.0001406812,0.00006860389,0.0002901567,0.0003532018,0.0001985062,0.000004870575],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001317254,"about_ca_system_score_gemma":0.00003740244,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002172683,"about_ca_topic_score_gemma":0.00002009909,"domain_scores_codex":[0.9988055,0.00002641856,0.0002099715,0.0004154023,0.0001872391,0.0003554467],"domain_scores_gemma":[0.9986985,0.0002427978,0.00009827445,0.0007818799,0.00005356253,0.0001249788],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001956869,0.00007987157,0.0007965714,0.00004940709,0.00005957115,0.00002795537,0.0009507364,0.003924847,0.07216945,0.02045305,0.8534945,0.04797444],"study_design_scores_gemma":[0.001838733,0.0002022138,0.001609599,0.00003391579,0.00003571116,0.0001204348,0.00003407119,0.3383229,0.02714549,0.01777977,0.611238,0.001639102],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05003956,0.0001049385,0.9221013,0.02631539,0.0005660711,0.0002333526,0.000003368099,0.0004138094,0.0002222312],"genre_scores_gemma":[0.08116759,0.00003225639,0.8982491,0.02013057,0.0002158678,0.00004124712,0.000008063629,0.00001842349,0.0001368542],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3343981,"threshold_uncertainty_score":0.6738598,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"National Research Council Canada","funders":"","keywords":"Computer science; Implementation; Software; Programming language","authors":[{"name":"Stephen Michell","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0949414484074329,"gpt":0.3375656426295776,"spread":0.2426241942221447,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004238128,0.0001733806,0.0002115217,0.0001018579,0.0001924849,0.0001093858,0.001335494,0.00005660099,0.0001057407],"category_scores_gemma":[0.0004667349,0.0001359595,0.000107295,0.0004557507,0.0001098407,0.0005762746,0.0003943431,0.0002117863,0.00002225269],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007942988,"about_ca_system_score_gemma":0.00004803804,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001041119,"about_ca_topic_score_gemma":0.000006838592,"domain_scores_codex":[0.9980352,0.0002858398,0.0004528732,0.0003426815,0.0005331686,0.000350259],"domain_scores_gemma":[0.9972387,0.0007894696,0.0002939307,0.00151046,0.0001023405,0.00006510707],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0000103831,0.0002063208,0.003065041,0.0001477565,0.000228075,0.0001775211,0.009358037,0.0002275035,0.4169507,0.01457604,0.5487863,0.006266332],"study_design_scores_gemma":[0.002644916,0.0006830309,0.001968439,0.0006054786,0.0003133223,0.001407615,0.003101064,0.1338366,0.8257359,0.008535369,0.0184425,0.002725783],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04190495,0.0000518682,0.945052,0.01167325,0.0002162149,0.0006423327,0.000009119898,0.0003056133,0.0001446835],"genre_scores_gemma":[0.4020033,0.000002547772,0.5955738,0.002246087,0.00006806885,0.00004994975,0.000002146175,0.00001787616,0.00003622207],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5303438,"threshold_uncertainty_score":0.5544267,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}