{"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02147941,0.00012040576,0.94097126,0.0002842129,0.00006879874,0.000102001075,0.0001364095,0.032002736,0.0048347902],"genre_scores_gemma":[0.27367875,0.00023214881,0.71661955,0.00020261438,0.00005542487,0.00013399453,0.0005730777,0.00447629,0.004028204],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.992785,0.0018384298,0.00047785416,0.0007611186,0.0036186317,0.00051892595],"domain_scores_gemma":[0.9766451,0.01327338,0.0013379819,0.0053709764,0.0029691376,0.0004033564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057980446,0.0010401326,0.00090729154,0.0019459483,0.00085447344,0.0019676923,0.0028112275,0.00097394217,0.0044859564],"category_scores_gemma":[0.02074078,0.0009568507,0.0013538973,0.0011729264,0.0027758637,0.003818526,0.0031448533,0.0025072836,0.0014441905],"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.0014495163,0.00060637627,0.010889454,0.00088575797,0.00023101388,0.0012937405,0.002118909,0.12908304,0.07472716,0.18026678,0.023693953,0.5747543],"study_design_scores_gemma":[0.00042773888,0.00034100172,0.0012102169,0.00014552611,0.00011078256,0.0009492374,0.00019224548,0.79042006,0.096331574,0.05898916,0.050718702,0.0001636984],"about_ca_topic_score_codex":0.0055436464,"about_ca_topic_score_gemma":0.005620338,"teacher_disagreement_score":0.0057980446,"about_ca_system_score_codex":0.0011234949,"about_ca_system_score_gemma":0.003959149,"threshold_uncertainty_score":0.030663371},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004456075,0.0034490803,0.92577946,0.002155631,0.0025894118,0.0001484605,0.00026229222,0.008294123,0.052865524],"genre_scores_gemma":[0.1528805,0.0035335205,0.7759943,0.0034310657,0.0021062219,0.00089163834,0.00084447244,0.0029991886,0.05731906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99872464,0.00037334577,0.00012212052,0.00021002282,0.00038011256,0.00018961138],"domain_scores_gemma":[0.9987191,0.00024257312,0.0000948336,0.00054932316,0.00025882496,0.0001353317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014106197,0.00070058357,0.0007337147,0.00070300436,0.0018574958,0.0032801682,0.0027477946,0.00149453,0.011276723],"category_scores_gemma":[0.0021974277,0.00067753415,0.0010247373,0.00075754017,0.0015862165,0.0071263397,0.0034477157,0.0031882809,0.005609326],"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.00018606623,0.00003523192,0.00020415022,0.00024709836,0.00002102037,0.00014699552,0.00033391314,0.0022993595,0.0038663875,0.86453295,0.037830863,0.09029596],"study_design_scores_gemma":[0.00006425298,0.00011651611,0.000091110676,0.00010873677,0.00005025749,0.0004557133,0.000065608416,0.017464317,0.005857136,0.18171091,0.79396045,0.00005498238],"about_ca_topic_score_codex":0.0010417055,"about_ca_topic_score_gemma":0.0014438845,"teacher_disagreement_score":0.011276723,"about_ca_system_score_codex":0.0010021834,"about_ca_system_score_gemma":0.0014783688,"threshold_uncertainty_score":0.037724376},"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":"review","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033994368,0.5521316,0.010224547,0.04987862,0.23412974,0.00067854906,0.0016419126,0.0008340607,0.14708167],"genre_scores_gemma":[0.017002134,0.47880778,0.008462439,0.02213673,0.053251594,0.00048431245,0.005778653,0.00083049,0.4132458],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99722016,0.0003323179,0.0002772799,0.00027983438,0.001582926,0.00030752883],"domain_scores_gemma":[0.98895395,0.0007022905,0.00039069066,0.00031771167,0.008558726,0.001076565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004706143,0.0012150997,0.00086686225,0.0029816097,0.00065794174,0.0031882506,0.0019104914,0.0022321832,0.060964912],"category_scores_gemma":[0.0069017396,0.00042966162,0.0013233608,0.0024216233,0.00047561442,0.002773494,0.0015151283,0.0023672925,0.04093434],"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.00021653494,0.00010832713,0.00035341876,0.0015802969,0.000040836618,0.00012113115,0.00007168807,0.00033448776,0.0012043709,0.001030428,0.6991139,0.29582462],"study_design_scores_gemma":[0.0000144395135,0.000051738494,0.00042774156,0.0008102978,0.00003624524,0.000082311024,0.000053690197,0.00006476144,0.0004960746,0.0003727732,0.9975788,0.0000111138015],"about_ca_topic_score_codex":0.004723141,"about_ca_topic_score_gemma":0.009081038,"teacher_disagreement_score":0.060964912,"about_ca_system_score_codex":0.0023593924,"about_ca_system_score_gemma":0.0044691334,"threshold_uncertainty_score":0.20394796},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008232184,0.013532832,0.7229688,0.0043034535,0.0028337927,0.00016846533,0.00032354257,0.004302859,0.24333407],"genre_scores_gemma":[0.21889342,0.0100242235,0.6637476,0.0020279193,0.0018966371,0.0004307658,0.000584409,0.0015097172,0.10088533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99905914,0.0002469266,0.00007235382,0.00015302557,0.00040071772,0.00006771668],"domain_scores_gemma":[0.99950945,0.00014425706,0.000034763332,0.0001412722,0.00011913388,0.00005109133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009995541,0.00045877797,0.00043914685,0.000584463,0.0011633493,0.0025809593,0.0007626902,0.00068564585,0.0073613496],"category_scores_gemma":[0.0016946001,0.00044053132,0.00064048846,0.00080951327,0.0017409539,0.0020585535,0.0012119245,0.0019962813,0.0041190106],"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.000041808635,0.000026611628,0.00025627777,0.0001850558,0.0000145934755,0.000106128035,0.0003693773,0.005880896,0.0016638782,0.8489702,0.023530807,0.11895441],"study_design_scores_gemma":[0.000030469733,0.00003865623,0.00016893753,0.000063668165,0.000011019001,0.00029937,0.000055283428,0.01504806,0.0016773911,0.37166107,0.6109243,0.000021724958],"about_ca_topic_score_codex":0.0009658498,"about_ca_topic_score_gemma":0.0011741532,"teacher_disagreement_score":0.0073613496,"about_ca_system_score_codex":0.00079181214,"about_ca_system_score_gemma":0.0010774671,"threshold_uncertainty_score":0.024626195},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017996109,0.0051631117,0.6737414,0.004385626,0.001730829,0.0012555846,0.0022682382,0.055113528,0.25454208],"genre_scores_gemma":[0.02369049,0.009323567,0.645118,0.0035598434,0.00097630353,0.0021894446,0.008259852,0.0112780845,0.2956044],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9933282,0.0011198038,0.00055357965,0.0009190362,0.0035901035,0.0004892765],"domain_scores_gemma":[0.9934501,0.00072830176,0.00038507764,0.0024303643,0.002412647,0.00059352757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047854604,0.0016751208,0.0010657528,0.0033774856,0.0019221042,0.0072803427,0.004256129,0.0036060896,0.043929014],"category_scores_gemma":[0.0150043275,0.0021344633,0.0019772744,0.0025508362,0.0024621906,0.008793374,0.007921035,0.0061489753,0.07674797],"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.00013551557,0.00010543691,0.00031529117,0.0007817796,0.000046617613,0.00025205375,0.0006611897,0.0016552964,0.005094208,0.3026506,0.3074563,0.3808457],"study_design_scores_gemma":[0.000026333504,0.000024511115,0.000074262505,0.00017231626,0.000014760407,0.00034768565,0.000029240104,0.000825651,0.0015171902,0.021726046,0.9752152,0.000026739015],"about_ca_topic_score_codex":0.0030042427,"about_ca_topic_score_gemma":0.0022004973,"teacher_disagreement_score":0.043929014,"about_ca_system_score_codex":0.0013626337,"about_ca_system_score_gemma":0.005231153,"threshold_uncertainty_score":0.14695716},"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":"other","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053187773,0.004060341,0.013223712,0.35587367,0.014676392,0.00016462787,0.00044063848,0.0034973382,0.5548755],"genre_scores_gemma":[0.30049643,0.004832768,0.025039935,0.12633432,0.0034880969,0.00019544656,0.00088801567,0.0031522815,0.5355727],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959313,0.0016089885,0.00010612982,0.00032390447,0.0014001904,0.0006293969],"domain_scores_gemma":[0.9891101,0.0017464948,0.0005304265,0.0011490197,0.004138387,0.0033254821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059848474,0.0006425884,0.00028950485,0.0010254103,0.005834736,0.011466581,0.001158595,0.0030275746,0.04230348],"category_scores_gemma":[0.019874169,0.00042877172,0.00043466385,0.0006548623,0.0035785458,0.014028477,0.003640213,0.004975275,0.04400614],"study_design_candidate":"theoretical_or_conceptual","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.000052223782,0.00019233,0.004429758,0.000109283996,0.000018683024,0.00019822053,0.01396131,0.00006912097,0.0022156427,0.035001192,0.748573,0.19517936],"study_design_scores_gemma":[0.000011590356,0.000051289237,0.0020072153,0.000067119676,0.000009486867,0.00017730167,0.0077176695,0.00012979736,0.00043200023,0.0063881003,0.98298347,0.000025030322],"about_ca_topic_score_codex":0.009500527,"about_ca_topic_score_gemma":0.010827888,"teacher_disagreement_score":0.04230348,"about_ca_system_score_codex":0.0014853985,"about_ca_system_score_gemma":0.002117066,"threshold_uncertainty_score":0.14151919},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044695757,0.03721778,0.57623994,0.014564073,0.006615228,0.00009858249,0.000107477994,0.0020155604,0.31844562],"genre_scores_gemma":[0.5465463,0.017071242,0.32447544,0.0049596825,0.0022975304,0.00019414311,0.00020235396,0.0006978559,0.103555515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999315,0.0001619033,0.000030280778,0.0000983865,0.00031262575,0.000081860075],"domain_scores_gemma":[0.9991247,0.0003301625,0.00005026118,0.00016515832,0.00019257692,0.0001371754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000735556,0.00025105942,0.00027110756,0.00033892193,0.0007533245,0.002057309,0.0006393105,0.000765016,0.006342334],"category_scores_gemma":[0.0018414502,0.00030325085,0.00019406265,0.00029829727,0.001328422,0.003017159,0.0011752845,0.0026160234,0.0016255605],"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.000065385,0.00004661043,0.00036304237,0.0001590019,0.000009787646,0.00014119322,0.00017399805,0.0069496585,0.0035090179,0.86582583,0.017334765,0.10542162],"study_design_scores_gemma":[0.000029993378,0.00009320683,0.00041759197,0.00014437544,0.00000999693,0.00044819497,0.00012627563,0.04312189,0.0040041087,0.5838267,0.36774132,0.000036319412],"about_ca_topic_score_codex":0.00044353356,"about_ca_topic_score_gemma":0.0007615577,"teacher_disagreement_score":0.006342334,"about_ca_system_score_codex":0.0005619076,"about_ca_system_score_gemma":0.0005578176,"threshold_uncertainty_score":0.021217167},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016700152,0.00014677456,0.9953738,0.00023982499,0.000060886654,0.00004462076,0.000027659298,0.0006131755,0.0018233008],"genre_scores_gemma":[0.11325925,0.00074599107,0.8797451,0.00026545709,0.00015354574,0.00024448385,0.00013368686,0.0002257243,0.0052267076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969363,0.000766513,0.00024386428,0.00040174363,0.0013795445,0.00027207026],"domain_scores_gemma":[0.9968933,0.0014404905,0.00021952626,0.0008252169,0.00052200444,0.00009943199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034016166,0.00066231197,0.0005869874,0.0010286832,0.001213644,0.0029489289,0.0030444232,0.0013967628,0.0033219242],"category_scores_gemma":[0.004939621,0.0011795576,0.002309416,0.00061510154,0.0054884367,0.0045548314,0.0024817442,0.0039150245,0.00087103696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.000063783686,0.00008032023,0.00022022094,0.00029123636,0.000040926963,0.00027581883,0.00083449326,0.029243147,0.011794208,0.9019442,0.0021474096,0.053064167],"study_design_scores_gemma":[0.000097108765,0.00013157347,0.00012401924,0.00014125535,0.00008990167,0.00047952382,0.00017970744,0.17773405,0.027465107,0.70465523,0.088822365,0.00008016896],"about_ca_topic_score_codex":0.002581675,"about_ca_topic_score_gemma":0.0026135112,"teacher_disagreement_score":0.0034016166,"about_ca_system_score_codex":0.0015507207,"about_ca_system_score_gemma":0.0027202468,"threshold_uncertainty_score":0.017989695},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014326574,0.016728967,0.24318838,0.10416773,0.057844326,0.00025893157,0.00048775497,0.0057592588,0.55723804],"genre_scores_gemma":[0.20727995,0.013362946,0.25266486,0.030644098,0.018519636,0.00046516725,0.0009215215,0.0026140234,0.47352773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969764,0.00058209285,0.0002208183,0.0003384594,0.0014407142,0.00044154798],"domain_scores_gemma":[0.9960252,0.0006358173,0.00027690353,0.0006470293,0.0015632366,0.00085174345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063211326,0.00065651676,0.0003313402,0.0007147221,0.0017155085,0.0057286685,0.0012221582,0.0021429881,0.030883867],"category_scores_gemma":[0.0068731327,0.00057019695,0.0005645625,0.00042460082,0.001676968,0.004909178,0.0019213477,0.006294774,0.010611171],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00016442861,0.00010216024,0.00026114788,0.00023965075,0.000010166305,0.00030523332,0.0012118744,0.00077652803,0.0072355843,0.6443093,0.182717,0.16266699],"study_design_scores_gemma":[0.000028792225,0.00006713477,0.000115315284,0.00007904014,0.000004345098,0.00017750534,0.00012061541,0.000832298,0.0012323239,0.02674169,0.9705866,0.000014411353],"about_ca_topic_score_codex":0.0023693577,"about_ca_topic_score_gemma":0.0029336615,"teacher_disagreement_score":0.030883867,"about_ca_system_score_codex":0.0030081647,"about_ca_system_score_gemma":0.0030654082,"threshold_uncertainty_score":0.10331684},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018700778,0.00039074468,0.9143149,0.000503171,0.0001798293,0.00035460506,0.0010840358,0.051748257,0.029554375],"genre_scores_gemma":[0.06231455,0.0010189747,0.8653484,0.0007495903,0.00017356029,0.0012060859,0.008013928,0.020006387,0.041168533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976549,0.00043925285,0.00021997323,0.00038526105,0.0009811742,0.00031930278],"domain_scores_gemma":[0.9975286,0.0005355929,0.00015323066,0.0011037275,0.00049971836,0.00017915589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041485303,0.0012980538,0.0007579005,0.0014373084,0.0012658192,0.004517566,0.0038741652,0.0023597986,0.022558607],"category_scores_gemma":[0.0079549095,0.0013418556,0.0017538654,0.0011085897,0.0012928629,0.0069853184,0.0038411731,0.0029819286,0.013374043],"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.00020679238,0.00014845883,0.001492531,0.000612634,0.000081119106,0.00039682348,0.00075745885,0.010209661,0.0055088312,0.49370727,0.102015324,0.38486317],"study_design_scores_gemma":[0.0001008215,0.000090464535,0.00039720783,0.00015625951,0.00003994706,0.0005166717,0.00012373588,0.032516796,0.0056103067,0.09073775,0.8696349,0.00007500181],"about_ca_topic_score_codex":0.0084675895,"about_ca_topic_score_gemma":0.007575961,"teacher_disagreement_score":0.022558607,"about_ca_system_score_codex":0.0014035967,"about_ca_system_score_gemma":0.003381017,"threshold_uncertainty_score":0.07546604},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011268422,0.00028086416,0.9534842,0.00014757515,0.000050878964,0.00011779831,0.00004164339,0.019316202,0.015292408],"genre_scores_gemma":[0.23548652,0.0005284707,0.7414503,0.00022652722,0.00005071279,0.00018187397,0.00019667555,0.002964947,0.018913932],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972409,0.0006246334,0.00028511882,0.00028877973,0.001243353,0.00031727203],"domain_scores_gemma":[0.99552286,0.0013792594,0.0003572382,0.0017455771,0.0008665884,0.00012859501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024806242,0.001215994,0.0005058641,0.00079081795,0.0007243017,0.0020463131,0.003105986,0.001079828,0.016845135],"category_scores_gemma":[0.009536861,0.0010085683,0.0007885357,0.00057916134,0.00074526406,0.005096703,0.0016651289,0.0017666522,0.008941693],"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.0011733202,0.00031745,0.0013591679,0.00064955413,0.00007747973,0.00045451242,0.0015445224,0.01594765,0.06276705,0.16159342,0.014785567,0.7393303],"study_design_scores_gemma":[0.00042742302,0.0020640108,0.00094732613,0.00046817242,0.00016345366,0.0034020112,0.00048887776,0.24369612,0.27266568,0.12094171,0.35436797,0.00036720195],"about_ca_topic_score_codex":0.00061377714,"about_ca_topic_score_gemma":0.0014005684,"teacher_disagreement_score":0.016845135,"about_ca_system_score_codex":0.0005178156,"about_ca_system_score_gemma":0.0008982046,"threshold_uncertainty_score":0.056352615},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042036347,0.00031789686,0.9185722,0.00022861281,0.000080251564,0.0001668091,0.00019780829,0.01365297,0.024747206],"genre_scores_gemma":[0.3526368,0.00036527697,0.62337786,0.00034041,0.000048490358,0.00027753503,0.00047856307,0.0029902062,0.01948487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990256,0.00017112063,0.000088119465,0.00014621907,0.0003663509,0.00020266965],"domain_scores_gemma":[0.99855477,0.0003102834,0.00018320534,0.00062449253,0.00027746914,0.00004973011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011469153,0.00064509845,0.00056528347,0.0005827028,0.00067581964,0.0014232987,0.0015666373,0.0006374224,0.006008788],"category_scores_gemma":[0.0028174475,0.0005198442,0.0009722483,0.0009071659,0.0016800667,0.003182001,0.002746351,0.0012098505,0.001511499],"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.00092093373,0.00017152612,0.0035851724,0.00065470726,0.00008599012,0.00053363387,0.00083825266,0.082738854,0.05784775,0.5445875,0.016390808,0.29164493],"study_design_scores_gemma":[0.00028067036,0.00046277104,0.0007382003,0.00015632791,0.00013119337,0.0005909676,0.00021507127,0.3994295,0.13968493,0.3210076,0.13717078,0.0001319967],"about_ca_topic_score_codex":0.0022982112,"about_ca_topic_score_gemma":0.004383067,"teacher_disagreement_score":0.006008788,"about_ca_system_score_codex":0.0011515592,"about_ca_system_score_gemma":0.0020340995,"threshold_uncertainty_score":0.020101368},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010816004,0.00076381036,0.9722678,0.00057121925,0.00013007995,0.000102412116,0.00009425608,0.0005732138,0.014681168],"genre_scores_gemma":[0.27963507,0.0014190605,0.7000867,0.000329472,0.00024399793,0.00044479675,0.00033327672,0.0005857146,0.016921889],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988524,0.00025746308,0.000050523387,0.00014428726,0.0006013862,0.00009396592],"domain_scores_gemma":[0.99949086,0.00013912849,0.000022347596,0.00025011858,0.000078736564,0.000018722829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054232427,0.0005191047,0.0007857071,0.00037031635,0.0006238385,0.0013271,0.0011016211,0.0005294545,0.003400209],"category_scores_gemma":[0.0013996263,0.00031777073,0.0010950853,0.00053554645,0.0014570118,0.0019810211,0.001274149,0.0022395295,0.0011279383],"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.0001319152,0.000116324205,0.0003151663,0.00023239506,0.000043788048,0.00013938684,0.00023592442,0.13665034,0.010029903,0.7680984,0.005677397,0.07832915],"study_design_scores_gemma":[0.000043047155,0.000073286115,0.0001695388,0.00002701602,0.000019970696,0.0001298841,0.00004390732,0.4100057,0.0055121887,0.53838986,0.04556623,0.000019337682],"about_ca_topic_score_codex":0.0011546836,"about_ca_topic_score_gemma":0.001608762,"teacher_disagreement_score":0.003400209,"about_ca_system_score_codex":0.00072252646,"about_ca_system_score_gemma":0.00078517606,"threshold_uncertainty_score":0.011374831},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008825378,0.00098896,0.9182711,0.0004957753,0.0018009942,0.0002608024,0.0011219587,0.017785624,0.050449416],"genre_scores_gemma":[0.28616205,0.0021518727,0.5778896,0.0019500842,0.0015619207,0.001066049,0.003447381,0.006692103,0.11907893],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99770576,0.00050758594,0.00021137789,0.00044462582,0.0008645208,0.00026612432],"domain_scores_gemma":[0.9978047,0.00065230846,0.00026052966,0.00042373038,0.0007206164,0.00013814514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014847853,0.0012080243,0.00069409044,0.0010702932,0.0007877819,0.0034900764,0.0013776276,0.0010994131,0.033680778],"category_scores_gemma":[0.003906274,0.00057884323,0.0008031352,0.0009406194,0.0011729515,0.0033369164,0.0017798999,0.0017578128,0.0122911325],"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.0014666244,0.00012425275,0.0011142167,0.0010012714,0.000066610024,0.0004985137,0.0007967848,0.007483023,0.019120432,0.6225494,0.0726143,0.2731646],"study_design_scores_gemma":[0.00022282617,0.00049465575,0.0003187433,0.00018171701,0.00008067367,0.00065762445,0.00013967635,0.030464973,0.027797189,0.08437092,0.8551791,0.00009189091],"about_ca_topic_score_codex":0.00084291777,"about_ca_topic_score_gemma":0.0010711362,"teacher_disagreement_score":0.033680778,"about_ca_system_score_codex":0.0008240082,"about_ca_system_score_gemma":0.0011501724,"threshold_uncertainty_score":0.1126734},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005555152,0.01965418,0.0044161105,0.118208386,0.58845806,0.0006345958,0.0048296615,0.0024758766,0.2557679],"genre_scores_gemma":[0.016092516,0.013084852,0.0026704404,0.010913121,0.068760455,0.00065637403,0.0066275373,0.0015161788,0.8796786],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.98922896,0.0007484951,0.00047731283,0.00063628994,0.006940759,0.0019682387],"domain_scores_gemma":[0.96984756,0.00079489907,0.0005616674,0.0008682147,0.014312858,0.013614757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0111311525,0.0026020429,0.0018354938,0.005012576,0.0048173293,0.015994025,0.0020217628,0.004802819,0.1427292],"category_scores_gemma":[0.01809884,0.000601854,0.0013662408,0.0031363335,0.0011317827,0.004773174,0.007907355,0.006190983,0.14259915],"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.00005135446,0.000042189473,0.00017964152,0.000054812077,0.0000058015203,0.000056062694,0.000024827354,0.000048423364,0.000077972276,0.001315259,0.96843106,0.029712697],"study_design_scores_gemma":[0.000018637067,0.000036179717,0.0005790354,0.00006470865,0.000005463988,0.000038846614,0.00012853385,0.00008836849,0.00011284258,0.000839096,0.9980744,0.000013808217],"about_ca_topic_score_codex":0.0039482466,"about_ca_topic_score_gemma":0.008411191,"teacher_disagreement_score":0.1427292,"about_ca_system_score_codex":0.003613044,"about_ca_system_score_gemma":0.007851921,"threshold_uncertainty_score":0.47747672},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4862401,0.0005200614,0.48422778,0.00031639502,0.000040464776,0.00027775503,0.0014675959,0.022960266,0.003949616],"genre_scores_gemma":[0.8229867,0.00022182145,0.17263398,0.000057220343,0.00002892185,0.00023265339,0.0015465791,0.0013536842,0.00093839836],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971214,0.0006121988,0.0002170583,0.00044796933,0.0014724619,0.00012884857],"domain_scores_gemma":[0.98769134,0.005245186,0.0016145973,0.0020125133,0.0031887745,0.00024758597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020079662,0.0007988045,0.0006140504,0.0038233686,0.00037046944,0.0014799619,0.00066275493,0.0004273637,0.0010623646],"category_scores_gemma":[0.011613202,0.00032420582,0.0004986863,0.0021891096,0.00050845544,0.0016546864,0.0007021791,0.0009956672,0.00037963747],"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.0007928906,0.0007681139,0.09256607,0.0008536768,0.00019322363,0.0005228175,0.0044496604,0.03668693,0.30511045,0.010313111,0.004247909,0.54349524],"study_design_scores_gemma":[0.00007182438,0.0013365534,0.12699081,0.00016960628,0.00021459533,0.0009471068,0.0012065124,0.57922053,0.25613624,0.012594124,0.020922013,0.00019008541],"about_ca_topic_score_codex":0.0016345389,"about_ca_topic_score_gemma":0.0014748422,"teacher_disagreement_score":0.0038233686,"about_ca_system_score_codex":0.0006305195,"about_ca_system_score_gemma":0.0007212046,"threshold_uncertainty_score":0.010619223},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011801994,0.005991384,0.8228775,0.0055155144,0.002652518,0.00038097665,0.0012678027,0.048942287,0.10057003],"genre_scores_gemma":[0.1299311,0.0044054897,0.7892152,0.0020276664,0.001046302,0.0004260536,0.0028551791,0.0074008177,0.06269208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902904,0.0001944272,0.00011608848,0.00016314772,0.00038362303,0.000113629016],"domain_scores_gemma":[0.9985441,0.00021377059,0.00012423359,0.0006515654,0.00027841562,0.00018786121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018294896,0.00069749117,0.00070003234,0.00081664196,0.0013221873,0.0033594128,0.0014785356,0.0013849409,0.015172908],"category_scores_gemma":[0.0028656826,0.00076819333,0.0013725699,0.00096759375,0.0013702668,0.002949466,0.002173003,0.0032890365,0.006486164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00028552927,0.000097273,0.0009372763,0.00062447705,0.000039133392,0.00028063986,0.0007951584,0.005542533,0.008729443,0.55676454,0.13025782,0.29564613],"study_design_scores_gemma":[0.00005072987,0.00006121035,0.00028180936,0.00011308127,0.000017247332,0.00037770256,0.00004462803,0.008171025,0.0023205625,0.06441791,0.9241105,0.000033678647],"about_ca_topic_score_codex":0.0016564565,"about_ca_topic_score_gemma":0.0021740734,"teacher_disagreement_score":0.015172908,"about_ca_system_score_codex":0.001592261,"about_ca_system_score_gemma":0.0019929942,"threshold_uncertainty_score":0.05075842},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028754847,0.01968294,0.56033665,0.021247314,0.0022445056,0.00027661337,0.0003777573,0.0010795322,0.36599985],"genre_scores_gemma":[0.8087605,0.009963694,0.11577208,0.0018177042,0.0021178937,0.000683951,0.00042083143,0.00034130513,0.06012198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99697363,0.001022412,0.00018270414,0.00067097787,0.0008237104,0.0003265622],"domain_scores_gemma":[0.9964947,0.001565898,0.00029385323,0.000766012,0.00041942345,0.00045999332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003299796,0.00053072727,0.0009991499,0.001297607,0.00379641,0.0072572967,0.0012453188,0.0023316848,0.008788625],"category_scores_gemma":[0.008296478,0.00050146406,0.00074516464,0.0021961932,0.0077025937,0.012429361,0.004204571,0.0034130872,0.0016091304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.0000044944095,0.0000033834951,0.00003966452,0.000015475583,0.0000023574696,0.00001841912,0.00018229104,0.00050471036,0.000038807153,0.99571985,0.0009222243,0.0025483058],"study_design_scores_gemma":[0.000012388768,0.000008346826,0.00005355667,0.000014573013,0.0000042891675,0.000029641154,0.00008208167,0.002796002,0.00007536051,0.9578802,0.039036784,0.000006746006],"about_ca_topic_score_codex":0.004007864,"about_ca_topic_score_gemma":0.0019893895,"teacher_disagreement_score":0.008788625,"about_ca_system_score_codex":0.004152399,"about_ca_system_score_gemma":0.0020823374,"threshold_uncertainty_score":0.030127943},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044284435,0.0023024494,0.69263536,0.0011234664,0.0015805128,0.00073096366,0.0018809554,0.12653203,0.16878577],"genre_scores_gemma":[0.092002526,0.0050745723,0.604131,0.0028832343,0.0008323707,0.0018094602,0.0141062355,0.051490594,0.22766995],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.997973,0.0003293158,0.00022907484,0.00030847738,0.0009939433,0.00016606927],"domain_scores_gemma":[0.99771833,0.00055504666,0.00017507108,0.00072752737,0.0006092639,0.00021478673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00188072,0.0011864755,0.00063239265,0.001319127,0.00097073644,0.004081352,0.0024529172,0.0015879868,0.032074064],"category_scores_gemma":[0.006556825,0.001214594,0.0015453647,0.00076833175,0.00077982515,0.005456275,0.0042034313,0.003395462,0.025655719],"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.00045035433,0.00020207075,0.0016404149,0.0015279504,0.00013771764,0.00075421494,0.001514499,0.0025335406,0.019672997,0.30880612,0.23495482,0.42780527],"study_design_scores_gemma":[0.00003286784,0.000025374256,0.00016515903,0.00008806095,0.000025093063,0.00044668317,0.000050660627,0.002388194,0.0035579691,0.017216805,0.97597957,0.000023524824],"about_ca_topic_score_codex":0.0011355121,"about_ca_topic_score_gemma":0.0016037785,"teacher_disagreement_score":0.032074064,"about_ca_system_score_codex":0.00063492643,"about_ca_system_score_gemma":0.0016627302,"threshold_uncertainty_score":0},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0775377,0.0005625732,0.82412535,0.0009407,0.00049926376,0.00023449775,0.0002586276,0.04936399,0.046477254],"genre_scores_gemma":[0.5871828,0.00027678692,0.37176844,0.0005162204,0.00014358667,0.00019846903,0.00054460205,0.0016773078,0.03769184],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99910694,0.00012817411,0.000059301343,0.0002086627,0.0004064378,0.00009048517],"domain_scores_gemma":[0.998694,0.00023142486,0.00017019846,0.00047147003,0.0003048839,0.00012803514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011781113,0.00043719934,0.00034924544,0.00050187006,0.0005347747,0.0023840987,0.0015323207,0.0005896279,0.0043500517],"category_scores_gemma":[0.002054549,0.0004387284,0.00029344976,0.0002435041,0.0005875984,0.0019730586,0.0010286905,0.0012043776,0.0010023759],"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.0019316628,0.0005991087,0.0082219895,0.00031408435,0.00008030822,0.0006041912,0.0020103727,0.021036789,0.0821766,0.17108546,0.05291812,0.6590213],"study_design_scores_gemma":[0.00039452608,0.00064279797,0.0037350417,0.00011217955,0.00011115063,0.0011653665,0.0002435791,0.24940312,0.14928949,0.031130727,0.56361026,0.00016176423],"about_ca_topic_score_codex":0.0017664318,"about_ca_topic_score_gemma":0.0022535438,"teacher_disagreement_score":0.0043500517,"about_ca_system_score_codex":0.0008205926,"about_ca_system_score_gemma":0.0009255837,"threshold_uncertainty_score":0.014552414},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14762053,0.00051309355,0.8230609,0.0008771758,0.00022818406,0.00008695468,0.0000952311,0.0018706676,0.025647132],"genre_scores_gemma":[0.7113117,0.00047844936,0.26500142,0.00015742985,0.00007718239,0.00009285926,0.00013960793,0.00022610436,0.02251516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99974865,0.000069968424,0.0000161648,0.00003235318,0.00009602767,0.000036726608],"domain_scores_gemma":[0.999496,0.00021720328,0.000048668535,0.00010511631,0.000090910835,0.000042145464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005491614,0.00019122024,0.00023480425,0.0001395481,0.00031263666,0.00082573894,0.00057922874,0.00029130868,0.0024616239],"category_scores_gemma":[0.0012499142,0.00015026321,0.0002124753,0.0001789807,0.00043668682,0.00070929044,0.00040054406,0.0007081571,0.00045129945],"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.00042120504,0.00017137463,0.0027042038,0.0002665855,0.000030061254,0.0004257796,0.00050667935,0.37599528,0.04745236,0.4704855,0.008494229,0.093046665],"study_design_scores_gemma":[0.000041474454,0.000092461785,0.0005282753,0.000017950775,0.000009299294,0.000083232786,0.000056865374,0.9153304,0.0062907813,0.057301007,0.02023775,0.0000105190165],"about_ca_topic_score_codex":0.0017263867,"about_ca_topic_score_gemma":0.00442652,"teacher_disagreement_score":0.0024616239,"about_ca_system_score_codex":0.00044431133,"about_ca_system_score_gemma":0.00083669403,"threshold_uncertainty_score":0.008234918},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0081120785,0.00059115305,0.9109638,0.00044053106,0.00069029344,0.00028153896,0.0006037739,0.04490915,0.033407655],"genre_scores_gemma":[0.12448284,0.00073828804,0.8116668,0.001054622,0.00028380298,0.00057651754,0.0031131206,0.008519231,0.049564734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998706,0.00015310122,0.00018155214,0.0002476025,0.00051388453,0.00019791545],"domain_scores_gemma":[0.99902105,0.00012318415,0.00010658423,0.00033127904,0.00025406564,0.00016381934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017517187,0.00076495286,0.000751369,0.0010768295,0.0011570851,0.004934769,0.0026265287,0.0009967763,0.011695225],"category_scores_gemma":[0.0021309715,0.001125401,0.0013416295,0.00069118047,0.00093331473,0.0038520815,0.0025444261,0.0028861894,0.006276049],"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.00084522145,0.00026307875,0.0024996246,0.00061303563,0.00011715554,0.00055210816,0.0015083055,0.012648492,0.026180295,0.4936629,0.15461631,0.3064935],"study_design_scores_gemma":[0.00012777637,0.00012737744,0.0004699167,0.00012845312,0.000072955256,0.00040611834,0.000085131294,0.03625197,0.01840301,0.028004343,0.9158132,0.00010985418],"about_ca_topic_score_codex":0.0036052933,"about_ca_topic_score_gemma":0.0040714927,"teacher_disagreement_score":0.011695225,"about_ca_system_score_codex":0.0018424795,"about_ca_system_score_gemma":0.002597762,"threshold_uncertainty_score":0.03912449},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014052745,0.00020307668,0.971501,0.0005417868,0.00019693756,0.00009545228,0.00008552917,0.004492699,0.008830757],"genre_scores_gemma":[0.15809444,0.00038215847,0.8306896,0.0006094172,0.00017129931,0.00029913904,0.00016355318,0.0010428024,0.008547468],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99829775,0.00047628974,0.00023830378,0.00020554593,0.0006338891,0.00014819227],"domain_scores_gemma":[0.9968707,0.0008980943,0.00030314023,0.0011015557,0.0006851362,0.00014137909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026104914,0.0005407924,0.00051519054,0.00048912596,0.00070474774,0.0023469534,0.0014250652,0.00083481375,0.002901728],"category_scores_gemma":[0.0039266767,0.00070137053,0.0013157749,0.0003498059,0.0021822627,0.0028003182,0.0021869475,0.002790393,0.0011351953],"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.00026312587,0.00012517629,0.0010478444,0.0003663122,0.00004249735,0.00058331894,0.0015521555,0.026772136,0.0112353675,0.8666469,0.0070408317,0.08432435],"study_design_scores_gemma":[0.00022728484,0.00021496725,0.0002686896,0.00023429198,0.00011204559,0.0011397586,0.00023081937,0.19000542,0.019109404,0.492115,0.29624134,0.00010097051],"about_ca_topic_score_codex":0.000494645,"about_ca_topic_score_gemma":0.0008838919,"teacher_disagreement_score":0.002901728,"about_ca_system_score_codex":0.00050707173,"about_ca_system_score_gemma":0.0013335928,"threshold_uncertainty_score":0.013805747},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010628233,0.0022018251,0.97437006,0.001112734,0.00056316186,0.000049370843,0.000038952516,0.0017003809,0.00933532],"genre_scores_gemma":[0.28551868,0.002259212,0.69968283,0.00064020895,0.00026414287,0.00010981331,0.00009035357,0.0006921091,0.010742653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987919,0.000299836,0.00010939566,0.0001617147,0.0005054626,0.00013170177],"domain_scores_gemma":[0.9989391,0.00025585422,0.00007073708,0.00045088076,0.00020942702,0.000073939635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015718596,0.00032097352,0.0005051466,0.00033647803,0.000594438,0.0018835956,0.00093150197,0.0005680288,0.0020285444],"category_scores_gemma":[0.0014954068,0.00045767834,0.0005679492,0.00035234957,0.0018471974,0.002181836,0.0008558974,0.0027018944,0.0005945264],"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.00020481124,0.00009378962,0.0002920982,0.00022310487,0.000026337399,0.00008954454,0.0005569027,0.038696114,0.02177353,0.8117429,0.005588636,0.12071231],"study_design_scores_gemma":[0.00013591947,0.0002210114,0.0003538778,0.00009715375,0.00003880882,0.00032609634,0.00010135976,0.2122165,0.025566697,0.4667103,0.2941133,0.00011902041],"about_ca_topic_score_codex":0.0009005368,"about_ca_topic_score_gemma":0.0015764545,"teacher_disagreement_score":0.0020285444,"about_ca_system_score_codex":0.00084278284,"about_ca_system_score_gemma":0.0006874085,"threshold_uncertainty_score":0.008312881},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029897286,0.00034861633,0.95322424,0.0002585597,0.00009130743,0.00021553262,0.00010743952,0.001957585,0.013899465],"genre_scores_gemma":[0.55230176,0.00036128977,0.4357632,0.00016315927,0.00003065172,0.0003228167,0.00022301698,0.00024977335,0.010584337],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992205,0.00013426578,0.000039547016,0.00011512961,0.00039515784,0.00009540612],"domain_scores_gemma":[0.99939156,0.000115074436,0.000057837908,0.00013991549,0.00026336708,0.000032237236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007189661,0.0004885531,0.00019747572,0.0004693893,0.00039711216,0.0011288702,0.00093760574,0.0006773369,0.0027879954],"category_scores_gemma":[0.0011316701,0.00030502363,0.00039059605,0.0001749861,0.0007167069,0.000597511,0.00072908425,0.00073862594,0.00074132497],"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.00033494105,0.00012409258,0.0023513616,0.0006545007,0.000088276225,0.0008321332,0.0007172718,0.456627,0.11167221,0.21198948,0.004757998,0.20985073],"study_design_scores_gemma":[0.00009610019,0.00038666933,0.0008461605,0.000116457704,0.00006960987,0.0002980818,0.000104437415,0.8281197,0.08053419,0.033526693,0.055867508,0.00003440317],"about_ca_topic_score_codex":0.0033595755,"about_ca_topic_score_gemma":0.004227673,"teacher_disagreement_score":0.0033595755,"about_ca_system_score_codex":0.00082504994,"about_ca_system_score_gemma":0.0017427406,"threshold_uncertainty_score":0.009326816},"labels":[],"label_agreement":null}]}