{"meta":{"query_hash":"d5a825dd973c","filters":{"venue":"New Trends in Software Methodologies, Tools and Techniques"},"cohort_total":16,"direct_labels_cover":0,"predictions_cover":16,"exported":16,"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/d5a825dd973c","api":"https://metacan.xera.ac/api/v1/cohort?venue=New+Trends+in+Software+Methodologies%2C+Tools+and+Techniques"},"results":[{"id":"W103353880","doi":"","title":"Automatic Enforcement of Security in Computer Networks","year":2007,"lang":"en","type":"article","venue":"New Trends in Software Methodologies, Tools and Techniques","topic":"Formal Methods in Verification","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":"Université Laval","funders":"","keywords":"Computer science; Process calculus; Security policy; Equivalence (formal languages); Network security policy; Enforcement; Network security; Computer security model; Process (computing); Computer security; Network Access Control; Operator (biology); Theoretical computer science; Security service; Information security; Programming language; Cloud computing security; Mathematics; Discrete mathematics; Operating system","score_opus":0.10198448663208472,"score_gpt":0.37790520556183893,"score_spread":0.2759207189297542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W103353880","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005270186,0.00035137238,0.9928381,0.0000470931,0.0002013875,0.00019966818,0.0000023560376,0.0005706842,0.00051919295],"genre_scores_gemma":[0.04497424,0.00012428437,0.9546948,0.00011105137,0.000046032394,0.00002106031,0.0000064732885,0.000009368328,0.000012701519],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997753,0.00047731903,0.0007458752,0.00042187897,0.00021245543,0.00038945387],"domain_scores_gemma":[0.99756163,0.0014888985,0.00025360766,0.0005873268,0.000041720687,0.0000667957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061044837,0.00020525338,0.000450706,0.00056107575,0.000031590967,0.000058015677,0.0006808779,0.00024443958,0.00002130414],"category_scores_gemma":[0.00061542686,0.0001868203,0.000060814546,0.0010203153,0.00010598271,0.0004872913,0.00045014292,0.00032860023,2.1065354e-7],"study_design_candidate":"design_other","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.000013243189,0.00003033427,0.0040858765,0.000028058177,0.0000047501185,0.000007668688,0.00054485904,0.00007468374,0.0000237329,0.029363487,0.00013431949,0.965689],"study_design_scores_gemma":[0.0019857686,0.0021329406,0.29527682,0.00081336725,0.000029791896,0.00009633215,0.00015331233,0.19348408,0.082841225,0.4148594,0.0066852192,0.0016417438],"about_ca_topic_score_codex":0.00025414894,"about_ca_topic_score_gemma":0.00007415906,"teacher_disagreement_score":0.96404725,"about_ca_system_score_codex":0.00010435884,"about_ca_system_score_gemma":0.000032465217,"threshold_uncertainty_score":0.76183105},"labels":[],"label_agreement":null},{"id":"W104865677","doi":"","title":"Toward Solving Equations in Kleene Algebras","year":2007,"lang":"en","type":"article","venue":"New Trends in Software Methodologies, Tools and Techniques","topic":"Logic, programming, and type systems","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":"Université Laval","funders":"","keywords":"Idempotence; Kleene algebra; Semiring; Mathematics; Sign (mathematics); Algebra over a field; Algebraic number; Identity (music); Algebraic equation; Kleene's recursion theorem; Resolution (logic); Applied mathematics; Zero (linguistics); Pure mathematics; Nonlinear system; Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.2150909377911314,"score_gpt":0.3822149273770571,"score_spread":0.1671239895859257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W104865677","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00051826006,0.0013656628,0.99366355,0.00044827303,0.0002413051,0.0001929043,0.0000013395304,0.0011657913,0.002402936],"genre_scores_gemma":[0.17622991,0.000111095986,0.8230358,0.0001884782,0.00008705186,0.0000370073,0.000007772124,0.000012873072,0.00029006432],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99770147,0.00032208036,0.00056118326,0.0005814765,0.00022975581,0.00060405117],"domain_scores_gemma":[0.997028,0.0021384747,0.00015712998,0.0004910153,0.000046678964,0.00013872578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045496994,0.00023954538,0.0004259377,0.00065205875,0.00007857715,0.00021886916,0.00069235533,0.00027741617,0.0000148648705],"category_scores_gemma":[0.002823667,0.00020662855,0.0000767341,0.0011144058,0.000082867016,0.00056620094,0.00040956636,0.00034260534,0.000002188221],"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.0000064838955,0.000024016712,0.0072235977,0.000013685884,0.000005257918,0.000045896522,0.00066427275,0.0000014487857,0.0001338435,0.13260686,0.0003648562,0.8589098],"study_design_scores_gemma":[0.0007920139,0.000528145,0.049529385,0.000069954054,0.000014202443,0.0000765786,0.00026852798,0.00016936407,0.020867765,0.8877377,0.039014064,0.00093231624],"about_ca_topic_score_codex":0.00095206127,"about_ca_topic_score_gemma":0.00059979304,"teacher_disagreement_score":0.85797745,"about_ca_system_score_codex":0.0001166249,"about_ca_system_score_gemma":0.00008932389,"threshold_uncertainty_score":0.8426068},"labels":[],"label_agreement":null},{"id":"W107363239","doi":"","title":"A Calculus for Distributed Firewall Specification and Verification","year":2006,"lang":"en","type":"article","venue":"New Trends in Software Methodologies, Tools and Techniques","topic":"Network Packet Processing and Optimization","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":"Université du Québec en Outaouais","funders":"","keywords":"Firewall (physics); Computer science; Application firewall; Stateful firewall; Process calculus; Semantics (computer science); Predicate transformer semantics; Network topology; Formal specification; Network calculus; Programming language; Theoretical computer science; Operational semantics; Distributed computing; Mathematics; Computer security; Computer network; Quality of service","score_opus":0.09806598485889861,"score_gpt":0.3405121344173353,"score_spread":0.24244614955843669,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W107363239","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00083477056,0.0010071258,0.99627763,0.000776562,0.00006135503,0.00016528148,0.000020330666,0.0007222551,0.00013469157],"genre_scores_gemma":[0.014827108,0.00025667367,0.9842515,0.000054466112,0.000087715016,0.000082585466,0.00018222489,0.000009865829,0.00024783582],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988797,0.000121458615,0.00027125192,0.00043542453,0.0000885352,0.0002036879],"domain_scores_gemma":[0.9989207,0.00057234935,0.0001341773,0.0002739201,0.000060216218,0.000038654638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000712132,0.00014448032,0.00020509446,0.0001498661,0.00010611721,0.0002332821,0.00021919652,0.00014979986,0.0000016785324],"category_scores_gemma":[0.0003598124,0.00013225531,0.000029163002,0.0004727848,0.0000620364,0.00041009593,0.000079378406,0.00009487351,1.3285916e-7],"study_design_candidate":"design_other","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.000015691186,0.000016038779,0.0008875616,0.000015316647,0.0000021437359,7.667499e-7,0.00009048957,0.000027908214,0.00017575231,0.009966365,0.0032394333,0.9855625],"study_design_scores_gemma":[0.0021650067,0.00076238386,0.15981035,0.0002802125,0.00006397891,0.000063619525,0.00006053679,0.04374264,0.049487773,0.5842194,0.15777798,0.0015661246],"about_ca_topic_score_codex":0.00009463509,"about_ca_topic_score_gemma":0.000027818513,"teacher_disagreement_score":0.9839964,"about_ca_system_score_codex":0.000051094106,"about_ca_system_score_gemma":0.000029880754,"threshold_uncertainty_score":0.5393215},"labels":[],"label_agreement":null},{"id":"W133269243","doi":"","title":"Normative Systems: the meeting point between Jurisprudence and Information Technology?A position paper","year":2007,"lang":"en","type":"article","venue":"New Trends in Software Methodologies, Tools and Techniques","topic":"Multi-Agent Systems and Negotiation","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":"Université du Québec en Outaouais","funders":"","keywords":"Normative; Consistency (knowledge bases); Jurisprudence; Computer science; Defeasible estate; Completeness (order theory); Defeasible reasoning; Management science; Epistemology; Information system; Artificial intelligence; Law; Political science; Mathematics; Engineering","score_opus":0.07036231274182794,"score_gpt":0.3434896284266164,"score_spread":0.27312731568478843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W133269243","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067305258,0.0010639984,0.9889416,0.0014730102,0.00013467534,0.00034451735,0.000010133033,0.0007938948,0.0005076346],"genre_scores_gemma":[0.180585,0.0003292464,0.81867343,0.00023408498,0.00007458805,0.00005143626,0.000014970422,0.0000074294335,0.000029839866],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9982503,0.0003276207,0.00060855405,0.00028782114,0.00022943736,0.0002962774],"domain_scores_gemma":[0.99766827,0.0014671051,0.00035052325,0.000373022,0.00008568849,0.00005540585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041093514,0.00019937241,0.0003056932,0.0005417988,0.00020023227,0.00029491514,0.00042472823,0.00027142835,0.0000017611616],"category_scores_gemma":[0.0008322611,0.00013955255,0.000034874225,0.0007542425,0.00009562464,0.0027731108,0.00033869105,0.00029948755,0.0000011665559],"study_design_candidate":"design_other","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.000007107205,0.0000047899593,0.009300864,0.00003489296,0.0000104913,0.0000026538655,0.001032864,0.0000033097583,0.00033370306,0.016168833,0.0004035111,0.97269696],"study_design_scores_gemma":[0.0018052842,0.001204166,0.74861515,0.0018667108,0.00010172101,0.00039715497,0.0034917886,0.0011754469,0.08539339,0.08998212,0.06399793,0.001969146],"about_ca_topic_score_codex":0.00036133023,"about_ca_topic_score_gemma":0.000029516848,"teacher_disagreement_score":0.97072786,"about_ca_system_score_codex":0.00008519871,"about_ca_system_score_gemma":0.000023991886,"threshold_uncertainty_score":0.56907874},"labels":[],"label_agreement":null},{"id":"W142148650","doi":"","title":"A Formal Translation From an Imperative Language With Array to a Declarative Language","year":2006,"lang":"en","type":"article","venue":"New Trends in Software Methodologies, Tools and Techniques","topic":"Logic, programming, and type 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":"Université Laval","funders":"","keywords":"Computer science; Programming language; Translation (biology); Function (biology); Fifth-generation programming language; Declarative programming; Natural language processing; Artificial intelligence; Programming paradigm; Inductive programming","score_opus":0.08441034786377535,"score_gpt":0.3616782562847342,"score_spread":0.27726790842095883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W142148650","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019464744,0.00077750394,0.97713697,0.0001933073,0.000048439248,0.00030545038,0.00001856239,0.00095731317,0.0010977206],"genre_scores_gemma":[0.26668128,0.00000661426,0.73280287,0.00012338898,0.00009555982,0.0000830928,0.000056491102,0.000011488754,0.00013923833],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982216,0.0004126123,0.00027916825,0.0005445412,0.00018927491,0.00035285336],"domain_scores_gemma":[0.9988754,0.0004901962,0.00010321922,0.00040231508,0.00003995853,0.00008895216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007205084,0.00024850757,0.00037022142,0.00023680447,0.00009266026,0.00027456347,0.0003962424,0.00016769762,0.000011977886],"category_scores_gemma":[0.00010294053,0.00017777988,0.00004716641,0.00054367236,0.000055045308,0.0009856668,0.00007696977,0.00019907145,0.000001130107],"study_design_candidate":"design_other","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.000049418508,0.000031422398,0.0016576173,0.0000053722783,0.000011282081,0.00004004357,0.012408198,0.000004528524,0.003962107,0.008790729,0.00012768016,0.9729116],"study_design_scores_gemma":[0.0038193364,0.007444803,0.074502885,0.00015327818,0.00009683309,0.0001700699,0.007893865,0.00039794366,0.6679904,0.21129021,0.023117732,0.0031226503],"about_ca_topic_score_codex":0.00481549,"about_ca_topic_score_gemma":0.003771769,"teacher_disagreement_score":0.96978897,"about_ca_system_score_codex":0.00004708822,"about_ca_system_score_gemma":0.00004709006,"threshold_uncertainty_score":0.72796124},"labels":[],"label_agreement":null},{"id":"W1576705238","doi":"","title":"Visualization Techniques for Program ComprehensionA Literature Review","year":2006,"lang":"en","type":"article","venue":"New Trends in Software Methodologies, Tools and Techniques","topic":"Software Engineering Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Visualization; Computer science; Software visualization; Field (mathematics); Software engineering; Component (thermodynamics); Point (geometry); Software; Data science; Key (lock); Software development; Information visualization; Data visualization; Component-based software engineering; Data mining; Programming language","score_opus":0.11033280646145692,"score_gpt":0.4198981169595048,"score_spread":0.30956531049804786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1576705238","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000056919882,0.036079805,0.9560094,0.00067458773,0.00009324271,0.0010547866,0.000021907317,0.0059017786,0.00010759382],"genre_scores_gemma":[0.0001558708,0.008549703,0.9894314,0.00030451073,0.00012999968,0.0009002702,0.00015484319,0.000035490022,0.00033791052],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976843,0.00030479112,0.0005046795,0.0007196595,0.00030889094,0.00047770207],"domain_scores_gemma":[0.9959604,0.0029569583,0.00012974345,0.00066630077,0.00020571856,0.000080880374],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016541892,0.0003250865,0.00054385315,0.0005598925,0.00008997322,0.00032374143,0.00075056276,0.00029869284,0.0000061393393],"category_scores_gemma":[0.002853999,0.00027897983,0.00012331095,0.0016686079,0.000075785094,0.0006192725,0.0003830245,0.00032507753,4.1757153e-7],"study_design_candidate":"design_other","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.000008521878,0.0000475543,0.001066014,0.0004826286,0.0000055556025,0.000013141462,0.000024215842,0.0000010982767,0.00019582838,0.008200806,0.024702163,0.96525246],"study_design_scores_gemma":[0.0007084023,0.0015795948,0.021858279,0.00846491,0.000040921863,0.000195867,0.0000045824836,0.00044351348,0.05962186,0.11674517,0.7888238,0.0015131432],"about_ca_topic_score_codex":0.00005146863,"about_ca_topic_score_gemma":0.000008380479,"teacher_disagreement_score":0.96373934,"about_ca_system_score_codex":0.00008434461,"about_ca_system_score_gemma":0.000056924877,"threshold_uncertainty_score":0.99996626},"labels":[],"label_agreement":null},{"id":"W174859251","doi":"","title":"A Formal Approach for the Forensic Analysis of Logs","year":2006,"lang":"en","type":"article","venue":"New Trends in Software Methodologies, Tools and Techniques","topic":"Digital and Cyber Forensics","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":"Concordia University","funders":"","keywords":"Computer forensics; Computer science; Digital forensics; Relevance (law); Audit; Digital evidence; Forensic science; Context (archaeology); Data science; Data mining; Information retrieval; Computer security","score_opus":0.10500992279942123,"score_gpt":0.3301998263517844,"score_spread":0.22518990355236318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W174859251","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007392283,0.0006489277,0.99557877,0.00018053486,0.000046699486,0.00017337853,0.000045836776,0.00034573037,0.002240902],"genre_scores_gemma":[0.025727384,0.00004097,0.973543,0.00010503103,0.000036974445,0.000078738856,0.000054934164,0.000008252873,0.00040475145],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998673,0.000079150814,0.0003827351,0.00036889096,0.000168256,0.00032796647],"domain_scores_gemma":[0.99769145,0.0015426086,0.0001609151,0.0005098313,0.000062799634,0.000032398388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010517035,0.00018399015,0.00047287985,0.00039557027,0.00007298432,0.00013796953,0.00066130306,0.00012679747,0.0000021808996],"category_scores_gemma":[0.0002616579,0.0001172381,0.0002386276,0.0015563034,0.0001809619,0.0005301365,0.00034776918,0.00011813231,4.9409607e-8],"study_design_candidate":"design_other","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.000014879594,0.00002487374,0.0017452787,0.000009668656,0.000070789036,8.542063e-7,0.000065090615,0.000081664344,0.000017935177,0.08602748,0.0017466439,0.9101949],"study_design_scores_gemma":[0.00094566913,0.000859581,0.11843089,0.00004062434,0.0007564472,0.000028511742,0.00013561611,0.013204255,0.025914524,0.81372815,0.02501112,0.0009445818],"about_ca_topic_score_codex":0.00036418953,"about_ca_topic_score_gemma":0.000111871945,"teacher_disagreement_score":0.90925026,"about_ca_system_score_codex":0.00002111302,"about_ca_system_score_gemma":0.000029227469,"threshold_uncertainty_score":0.4780831},"labels":[],"label_agreement":null},{"id":"W17764271","doi":"10.1063/1.2759489","title":"Enforcing Security Policies on Programs","year":2006,"lang":"en","type":"article","venue":"New Trends in Software Methodologies, Tools and Techniques","topic":"Security and Verification in Computing","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":"Université du Québec en Outaouais; Université Laval","funders":"","keywords":"Computer science; Automaton; Rewriting; Property (philosophy); Symbolic execution; Security policy; Programming language; Enforcement; Program analysis; Embedding; Theoretical computer science; Operator (biology); Computer security; Software","score_opus":0.14403330641402298,"score_gpt":0.3692185812553757,"score_spread":0.22518527484135273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W17764271","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009112495,0.0004948917,0.9815059,0.00096418615,0.00018989171,0.00018222854,0.000004603443,0.002564235,0.0049816137],"genre_scores_gemma":[0.10131278,0.00006145131,0.89793515,0.00028965904,0.0001628098,0.00003914733,0.000014634855,0.00001135286,0.00017303477],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981798,0.00028550345,0.00039125033,0.0005373712,0.00021388367,0.0003921819],"domain_scores_gemma":[0.9981115,0.0010981801,0.00015184542,0.0005373076,0.00004210257,0.000059096918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012167874,0.00022920771,0.00031332034,0.0003614647,0.00015047836,0.0003594557,0.00067477324,0.00020045966,0.000006932264],"category_scores_gemma":[0.00043758607,0.00020652261,0.000075978074,0.00079529715,0.000099576755,0.00041336316,0.0003269284,0.00033525508,0.0000012406407],"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.000006160132,0.000033475353,0.0035146757,0.000010820059,0.0000029078876,0.0000050746207,0.00039276876,0.000007612575,0.000050129554,0.1451068,0.0012990462,0.8495705],"study_design_scores_gemma":[0.00052255346,0.0006502653,0.0380887,0.00024966124,0.000010606576,0.0000612253,0.000112555004,0.0007777862,0.043612655,0.81911504,0.09588951,0.0009094507],"about_ca_topic_score_codex":0.0011338104,"about_ca_topic_score_gemma":0.00007377227,"teacher_disagreement_score":0.84866107,"about_ca_system_score_codex":0.000071554714,"about_ca_system_score_gemma":0.000040260154,"threshold_uncertainty_score":0.84217477},"labels":[],"label_agreement":null},{"id":"W1878813","doi":"10.1139/m91-053","title":"A Remark on Natural Language Processing from the Biolinguistic Perspective","year":2007,"lang":"en","type":"article","venue":"New Trends in Software Methodologies, Tools and Techniques","topic":"Natural Language Processing 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":true,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Perspective (graphical); Deep linguistic processing; Universal Networking Language; Language identification; Linguistics; Natural language; Natural (archaeology); Natural language processing; Language structure; Natural language programming; Object language; Language technology; Artificial intelligence; Cognitive science; Comprehension approach; Psychology; History","score_opus":0.07642038018737468,"score_gpt":0.39285066376176714,"score_spread":0.31643028357439246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1878813","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011660447,0.030928813,0.96201956,0.0012762133,0.0001910619,0.00021677227,0.000011997059,0.003135086,0.0010544584],"genre_scores_gemma":[0.13353357,0.00006798728,0.8650874,0.0008800367,0.00022953037,0.000018798268,0.000010843302,0.0000209832,0.0001508733],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99775076,0.00031616606,0.0003721251,0.0007708473,0.00031040763,0.00047969143],"domain_scores_gemma":[0.99539083,0.0035267184,0.00020945707,0.00067604316,0.00012080144,0.000076167824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022336773,0.00033494944,0.00038458337,0.00034046103,0.00018359993,0.00036754803,0.0012614337,0.00024409383,0.000007319691],"category_scores_gemma":[0.006633611,0.00021622435,0.000084752835,0.000945613,0.0001744676,0.00037438006,0.0004914628,0.00083593145,7.868721e-7],"study_design_candidate":"design_other","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.000050985385,0.000017050368,0.00040642938,0.0000074469153,0.0000073539786,0.000091413334,0.00239039,1.053572e-7,0.0007367436,0.01648424,0.0004927104,0.9793151],"study_design_scores_gemma":[0.0007531152,0.00063482765,0.018841939,0.0010944677,0.000049597762,0.00013588554,0.0020586122,0.00036220672,0.20053029,0.7662586,0.007730457,0.0015500006],"about_ca_topic_score_codex":0.0012908559,"about_ca_topic_score_gemma":0.00026164355,"teacher_disagreement_score":0.97776514,"about_ca_system_score_codex":0.00022301813,"about_ca_system_score_gemma":0.00007702364,"threshold_uncertainty_score":0.8817373},"labels":[],"label_agreement":null},{"id":"W188613399","doi":"","title":"Information Processing Redux","year":2010,"lang":"en","type":"article","venue":"New Trends in Software Methodologies, Tools and Techniques","topic":"Natural Language Processing 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":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Information extraction; Information processing; Information retrieval; Natural language processing; Natural language; Information system; Artificial intelligence; Process (computing); Question answering; Point (geometry); Programming language; Engineering","score_opus":0.07073178938678519,"score_gpt":0.3634253553560891,"score_spread":0.2926935659693039,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W188613399","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007753516,0.0010049543,0.9917754,0.00097458484,0.00015640508,0.00014088847,0.000005208183,0.0042480407,0.00091914675],"genre_scores_gemma":[0.010853207,0.00006078475,0.98836505,0.0004355032,0.00006941482,0.00005085815,0.000015102604,0.000011961953,0.00013808522],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985438,0.00012704315,0.00041021657,0.00033401523,0.00023254757,0.00035234937],"domain_scores_gemma":[0.99865746,0.000409018,0.0002128414,0.0005305638,0.00010009842,0.00009001683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014217397,0.00024402351,0.00030883995,0.00058562955,0.00011526821,0.0005907545,0.00096935383,0.00034921555,0.000014879352],"category_scores_gemma":[0.002064265,0.00020226148,0.000049514823,0.0008985377,0.00010969726,0.00328821,0.0005012383,0.0007602752,0.0000011552958],"study_design_candidate":"design_other","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.000006882774,0.0000074293075,0.00039903165,0.000024041918,0.0000017767866,0.0000049190176,0.00039138403,9.25284e-8,0.0020432095,0.015163713,0.001381868,0.9805757],"study_design_scores_gemma":[0.00034728777,0.00022481773,0.004109419,0.0001840617,0.000011358677,0.00018738948,0.000053785978,0.00018710522,0.23252933,0.7010189,0.06031542,0.00083109806],"about_ca_topic_score_codex":0.00014856148,"about_ca_topic_score_gemma":0.00004376006,"teacher_disagreement_score":0.97974455,"about_ca_system_score_codex":0.00003977086,"about_ca_system_score_gemma":0.00010683416,"threshold_uncertainty_score":0.82479835},"labels":[],"label_agreement":null},{"id":"W203907442","doi":"","title":"Formal Technique for Discovering Complex Attacks in Computer Systems","year":2007,"lang":"en","type":"article","venue":"New Trends in Software Methodologies, Tools and Techniques","topic":"Information and Cyber Security","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":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Middleware (distributed applications); Computer security; Complex system; Formal description; Software engineering; Distributed computing; Programming language","score_opus":0.15351140770131352,"score_gpt":0.38299358663425814,"score_spread":0.22948217893294462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W203907442","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00069287146,0.00014978687,0.99652433,0.00014981827,0.0002765024,0.00057425763,0.000018749995,0.0007708359,0.0008428619],"genre_scores_gemma":[0.023985168,0.000041486335,0.97532666,0.00027450634,0.000115607545,0.00015361728,0.000030484473,0.000013153231,0.000059309685],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99797434,0.00015184557,0.00069448503,0.00040212515,0.00018535087,0.00059185765],"domain_scores_gemma":[0.99819624,0.0010526661,0.00018131889,0.00042879302,0.000054158056,0.0000868165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038162358,0.0002558543,0.00045734455,0.00061589,0.00009843574,0.0002683887,0.0006576202,0.0002611392,0.000004337559],"category_scores_gemma":[0.000208199,0.0002286449,0.000085110136,0.0006188545,0.000065633925,0.0014783182,0.00048280062,0.0003058417,4.669611e-7],"study_design_candidate":"design_other","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.00003314022,0.000022783703,0.0015716846,0.00006245562,0.000005081972,0.000010104424,0.0006320547,0.00002981269,0.00019300076,0.04349973,0.0012411893,0.95269895],"study_design_scores_gemma":[0.0073316693,0.003527543,0.28005326,0.0016657909,0.000043718122,0.0008142236,0.0008937291,0.026862577,0.13372394,0.14005923,0.39947712,0.0055471747],"about_ca_topic_score_codex":0.00028333176,"about_ca_topic_score_gemma":0.00017481614,"teacher_disagreement_score":0.9471518,"about_ca_system_score_codex":0.00012569562,"about_ca_system_score_gemma":0.000042539014,"threshold_uncertainty_score":0.9323868},"labels":[],"label_agreement":null},{"id":"W2105268931","doi":"","title":"Information Processing and the Recovery of Argument Structure Asymmetries","year":2006,"lang":"en","type":"article","venue":"New Trends in Software Methodologies, Tools and Techniques","topic":"Natural Language Processing 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":"Université du Québec à Montréal","funders":"","keywords":"Argument (complex analysis); Computer science; Parsing; Relation (database); Natural language processing; Information structure; Artificial intelligence; Question answering; Linguistics; Data mining; Philosophy","score_opus":0.036107993123982184,"score_gpt":0.3134885648478385,"score_spread":0.27738057172385633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105268931","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016984555,0.009400227,0.9868208,0.0007825904,0.000045455778,0.00018788237,0.000013870197,0.00079605175,0.0002546349],"genre_scores_gemma":[0.04417288,0.00022303303,0.9553019,0.00017901043,0.000028916978,0.000021310525,0.000012729636,0.0000062444155,0.00005397756],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871004,0.00022301041,0.00043863853,0.00021716689,0.00021003697,0.00020110555],"domain_scores_gemma":[0.9984035,0.000871345,0.00031583532,0.00030495066,0.000080303056,0.000024095529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012320147,0.00018983537,0.00035630542,0.00040464153,0.00009111919,0.000335183,0.00048554814,0.00017942548,0.000002580502],"category_scores_gemma":[0.0010609234,0.0001193134,0.000041722524,0.0007454474,0.00023615762,0.0015796595,0.00038951213,0.00026455958,3.8697518e-8],"study_design_candidate":"design_other","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.00003689009,0.0000042182774,0.0005290603,0.000050079318,0.0000035353066,9.494404e-7,0.00028249895,0.0000011599567,0.00016659958,0.028447283,0.0005053593,0.9699724],"study_design_scores_gemma":[0.00045966025,0.00012738323,0.0036338249,0.00014865781,0.000013483183,0.000037572125,0.000049607672,0.00007306089,0.09293985,0.8992508,0.0030256645,0.00024041139],"about_ca_topic_score_codex":0.0004237636,"about_ca_topic_score_gemma":0.000032194093,"teacher_disagreement_score":0.9697319,"about_ca_system_score_codex":0.000038183774,"about_ca_system_score_gemma":0.00005023092,"threshold_uncertainty_score":0.48654595},"labels":[],"label_agreement":null},{"id":"W2121042490","doi":"","title":"On specifying systems that connect to the physical world","year":2006,"lang":"en","type":"article","venue":"New Trends in Software Methodologies, Tools and Techniques","topic":"Software Engineering Research","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":"McMaster University","funders":"","keywords":"Computer science; Domain (mathematical analysis); Base (topology); Software; Software engineering; Industrial engineering; Risk analysis (engineering); Engineering; Mathematics; Programming language","score_opus":0.17654207095559094,"score_gpt":0.37930087428864767,"score_spread":0.20275880333305674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121042490","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071759894,0.0006318522,0.9871581,0.001349182,0.00033024274,0.0003269488,0.000010144917,0.0021479274,0.00086957304],"genre_scores_gemma":[0.15506591,0.00002379138,0.84262663,0.00019627053,0.00038185192,0.00017457707,0.0000054123175,0.000031010386,0.0014945582],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977122,0.00043101734,0.00025151196,0.00064218894,0.0004378679,0.0005252482],"domain_scores_gemma":[0.98752874,0.011405451,0.00006533523,0.00086986314,0.000037316036,0.0000933092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017234727,0.00027540012,0.00041264022,0.0006009787,0.00011260361,0.00047018557,0.0011589176,0.00010053589,0.0000066365033],"category_scores_gemma":[0.0023187737,0.00018980003,0.000082509556,0.0013942934,0.000064470274,0.00026733943,0.0005491554,0.0004897516,0.0000063565644],"study_design_candidate":"design_other","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.00001961417,0.000031650772,0.0038050953,0.000018043904,0.000009034031,0.00003683054,0.0001651187,0.0006556121,0.000112082715,0.044562858,0.02695075,0.92363334],"study_design_scores_gemma":[0.0015200677,0.0019469626,0.30556643,0.0010576434,0.000034984136,0.00015799336,0.00011975458,0.0022462925,0.08560331,0.22178316,0.3771254,0.0028379844],"about_ca_topic_score_codex":0.0005419283,"about_ca_topic_score_gemma":0.00008417048,"teacher_disagreement_score":0.9207953,"about_ca_system_score_codex":0.000134712,"about_ca_system_score_gemma":0.000035267643,"threshold_uncertainty_score":0.7739821},"labels":[],"label_agreement":null},{"id":"W2889109524","doi":"","title":"Knowledge of Language and Knowledge Science.","year":2018,"lang":"en","type":"article","venue":"New Trends in Software Methodologies, Tools and Techniques","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec","funders":"","keywords":"Computer science; Knowledge management; Natural language processing","score_opus":0.10654051370661888,"score_gpt":0.41372093511566926,"score_spread":0.3071804214090504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889109524","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009954337,0.021098342,0.9619843,0.00020818811,0.00018524427,0.00018918245,0.000009594871,0.0022751682,0.004095675],"genre_scores_gemma":[0.08742798,0.00016014259,0.91186905,0.000053094856,0.00008490057,0.000017614224,0.0000017645502,0.000013122042,0.0003723485],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981743,0.00022516144,0.00036299854,0.00067774684,0.00016106383,0.0003987262],"domain_scores_gemma":[0.9981242,0.00080178864,0.00015728193,0.000621471,0.00018382103,0.00011147972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025262937,0.00024426111,0.00043172436,0.0009324254,0.00013482841,0.00019241283,0.0011704764,0.00019923571,0.000012201062],"category_scores_gemma":[0.0019878238,0.00019621178,0.000043816446,0.0018822324,0.0011004409,0.00088649767,0.0014123002,0.00027798803,8.3134614e-7],"study_design_candidate":"design_other","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.000008747497,0.000024115894,0.0005539284,0.000033612258,0.0000034225454,0.0000039617253,0.0029149274,4.5282147e-9,0.010087112,0.020322794,0.000625528,0.96542186],"study_design_scores_gemma":[0.0003123664,0.0006787446,0.0040735756,0.0002632613,0.000011494635,0.00006740614,0.0001679269,0.00007942157,0.80638224,0.18160851,0.0058452054,0.0005098641],"about_ca_topic_score_codex":0.0001652713,"about_ca_topic_score_gemma":0.00007820032,"teacher_disagreement_score":0.964912,"about_ca_system_score_codex":0.000062393454,"about_ca_system_score_gemma":0.00020078523,"threshold_uncertainty_score":0.80012846},"labels":[],"label_agreement":null},{"id":"W83007297","doi":"","title":"Handling Pronouns Intelligently","year":2005,"lang":"en","type":"article","venue":"New Trends in Software Methodologies, Tools and Techniques","topic":"Natural Language Processing Techniques","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":"Université du Québec à Montréal","funders":"","keywords":"Automatic summarization; Computer science; Anaphora (linguistics); Focus (optics); Identification (biology); Question answering; Interpretation (philosophy); Natural language processing; Resolution (logic); Artificial intelligence; Information retrieval; Programming language","score_opus":0.12023128723289653,"score_gpt":0.3808686564178361,"score_spread":0.2606373691849396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W83007297","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033554254,0.008659548,0.98443437,0.0015187702,0.00008755395,0.00017484161,0.000004400767,0.0042478587,0.00053712167],"genre_scores_gemma":[0.0051638293,0.0004577508,0.9929199,0.00051652687,0.0001470111,0.000061383565,0.000008058856,0.000022116532,0.0007033951],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99790174,0.00024763567,0.0004588568,0.000700759,0.00022590897,0.00046508684],"domain_scores_gemma":[0.99820644,0.00083047757,0.00016358514,0.0006323754,0.00006382654,0.000103311046],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015327925,0.00030586077,0.00042663855,0.0005459174,0.00010371034,0.00037369,0.0011492216,0.00028680253,0.00002461487],"category_scores_gemma":[0.0013029316,0.0002551089,0.00008221318,0.00080335635,0.000103098915,0.0011657033,0.0006708918,0.00051828177,0.0000022578954],"study_design_candidate":"design_other","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.00000978114,0.000020369926,0.00050779915,0.000013988773,0.0000059276604,0.00001268373,0.00034812736,0.0000012484961,0.00060725125,0.013203976,0.001545312,0.9837235],"study_design_scores_gemma":[0.0003139984,0.0003689568,0.00086903,0.00028790298,0.000016570526,0.00011971491,0.000035022014,0.00027798643,0.4720911,0.437231,0.0874574,0.0009312934],"about_ca_topic_score_codex":0.0001252752,"about_ca_topic_score_gemma":0.00007257238,"teacher_disagreement_score":0.98279226,"about_ca_system_score_codex":0.00012241083,"about_ca_system_score_gemma":0.00007458485,"threshold_uncertainty_score":0.9999901},"labels":[],"label_agreement":null},{"id":"W88494997","doi":"","title":"A Decision Procedure for Structured Cryptographic Protocols","year":2006,"lang":"en","type":"article","venue":"New Trends in Software Methodologies, Tools and Techniques","topic":"Advanced Authentication Protocols Security","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":"Université Laval; Carleton University","funders":"","keywords":"Cryptographic protocol; Decidability; Computer science; Cryptography; Cryptographic primitive; Protocol (science); Theoretical computer science; Secrecy; Inference; Set (abstract data type); Process (computing); Computer security; Programming language; Artificial intelligence","score_opus":0.10231443446074881,"score_gpt":0.40703954002257636,"score_spread":0.3047251055618275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W88494997","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021173239,0.00013746486,0.9789476,0.0002658607,0.000046997968,0.018848635,0.000023441973,0.0014183283,0.00009998236],"genre_scores_gemma":[0.0023320953,0.000008471705,0.9442077,0.000108256616,0.00006596114,0.053153023,0.000015244079,0.000021544934,0.00008767964],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99779403,0.00018783688,0.00054929784,0.00080549106,0.00024673014,0.00041662384],"domain_scores_gemma":[0.9974838,0.0013582166,0.00025673592,0.0007108809,0.00011562443,0.00007473569],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010190862,0.0002985513,0.000430569,0.00046723112,0.00012817438,0.00025600134,0.0008785474,0.0002730441,0.000010291345],"category_scores_gemma":[0.0015028417,0.00025126294,0.00011248588,0.0010094473,0.00010920241,0.00071908656,0.00032129802,0.00024937766,3.0391922e-7],"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.00005372097,0.000036647092,0.0017299505,0.000046571527,0.0000034078319,0.0000022070312,0.00005860879,0.000004939182,0.000674448,0.14045857,0.0006847723,0.8562462],"study_design_scores_gemma":[0.00059763703,0.00025920675,0.01633694,0.00011874462,0.0000044865424,0.000014914494,0.0000046493324,0.000104877945,0.025614819,0.9382144,0.018433578,0.00029570804],"about_ca_topic_score_codex":0.000031154883,"about_ca_topic_score_gemma":0.00006892497,"teacher_disagreement_score":0.8559504,"about_ca_system_score_codex":0.000053994812,"about_ca_system_score_gemma":0.000081862156,"threshold_uncertainty_score":0.999994},"labels":[],"label_agreement":null}]}