{"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":"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.03313118,0.00010394988,0.96170217,0.0001991836,0.000033704226,0.00009025828,0.00003293578,0.0022389677,0.0024676537],"genre_scores_gemma":[0.6736315,0.0002145943,0.32261682,0.00013095474,0.000044574786,0.0001777672,0.00011340411,0.00033789474,0.0027323877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9932348,0.0028480608,0.00046970937,0.0010498861,0.0019270438,0.0004705487],"domain_scores_gemma":[0.9922098,0.004139438,0.0007885153,0.0020882003,0.0006324,0.00014160873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045197434,0.000500898,0.0005131774,0.00069603825,0.0009122512,0.002029247,0.0017655881,0.0009183524,0.0015692136],"category_scores_gemma":[0.010280589,0.0005509182,0.00087127276,0.00042141599,0.0032424617,0.0038410968,0.002709294,0.0017303152,0.00027933874],"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.00033813584,0.0001892322,0.00223635,0.00031101512,0.000070660215,0.00053547265,0.000970725,0.21082535,0.064207144,0.6080845,0.0013378419,0.11089367],"study_design_scores_gemma":[0.00008876563,0.00011666863,0.000455721,0.00008280765,0.0000463301,0.00028279907,0.00010318226,0.70295113,0.070525,0.21118866,0.014105652,0.000053404045],"about_ca_topic_score_codex":0.0016174889,"about_ca_topic_score_gemma":0.0016602476,"teacher_disagreement_score":0.0045197434,"about_ca_system_score_codex":0.001496746,"about_ca_system_score_gemma":0.0014343256,"threshold_uncertainty_score":0.023903012},"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":"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.029723229,0.0007544563,0.9550079,0.0016751456,0.00007965459,0.000101085396,0.000074212476,0.0002564493,0.012327866],"genre_scores_gemma":[0.23317067,0.0023518144,0.7563625,0.0006289378,0.00025008767,0.00015831862,0.00027408014,0.00016499814,0.006638464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966365,0.0011935212,0.00025074795,0.0004460867,0.0011866753,0.00028639374],"domain_scores_gemma":[0.99557793,0.0030912042,0.00030346224,0.00034056793,0.0005438565,0.00014299779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004762332,0.00062875735,0.0008005191,0.0014955834,0.001401505,0.0034154886,0.001314086,0.0011889555,0.0031920718],"category_scores_gemma":[0.0118651735,0.00062376366,0.0024708232,0.0015015404,0.003410506,0.00905603,0.003702724,0.0052284645,0.00069090945],"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.000026310367,0.000050478604,0.00042980406,0.00017837688,0.000040748,0.000104504754,0.0009592722,0.010734337,0.002863488,0.96180344,0.0007356374,0.022073692],"study_design_scores_gemma":[0.000028063305,0.000026238527,0.00013937402,0.000084306375,0.000036786954,0.0000971618,0.00041626563,0.04024556,0.004865286,0.9414588,0.012573971,0.00002812879],"about_ca_topic_score_codex":0.0020734596,"about_ca_topic_score_gemma":0.002592302,"teacher_disagreement_score":0.004762332,"about_ca_system_score_codex":0.0012627702,"about_ca_system_score_gemma":0.0018766071,"threshold_uncertainty_score":0.025185943},"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":"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.0012789073,0.00007735508,0.9951231,0.00019297878,0.00007794542,0.00005870727,0.000055911216,0.0006940419,0.0024411608],"genre_scores_gemma":[0.11854977,0.00046532275,0.87358356,0.00038757912,0.00021025518,0.00048942707,0.00033111082,0.0004461127,0.0055367057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99439454,0.0011451829,0.00058529305,0.0005674018,0.0028098503,0.0004976946],"domain_scores_gemma":[0.9954659,0.0022845913,0.0002527979,0.0008147247,0.0009528091,0.00022916583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064238524,0.00085968047,0.0010864343,0.0012545013,0.0023564333,0.004029683,0.0029629471,0.0020776372,0.003269627],"category_scores_gemma":[0.010141262,0.0011390857,0.0027327999,0.0012866227,0.0043987804,0.005174082,0.004037903,0.0041464446,0.0010548336],"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.000029889397,0.000041139294,0.0001405244,0.00006737267,0.000020486357,0.00027719903,0.00030324684,0.012513527,0.0034011807,0.96817845,0.0015246065,0.013502403],"study_design_scores_gemma":[0.00009755534,0.00003507634,0.000100893594,0.00008209,0.000053921693,0.00022528395,0.00006574532,0.14360386,0.006246276,0.81364316,0.03578402,0.00006211974],"about_ca_topic_score_codex":0.006185142,"about_ca_topic_score_gemma":0.003979281,"teacher_disagreement_score":0.0064238524,"about_ca_system_score_codex":0.002308298,"about_ca_system_score_gemma":0.005114251,"threshold_uncertainty_score":0.03397298},"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":"commentary","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.009962077,0.02330286,0.12371348,0.49379376,0.0067204437,0.00008326291,0.00006821277,0.00017197183,0.34218398],"genre_scores_gemma":[0.78979844,0.021586007,0.0643372,0.034778927,0.011064542,0.0005590879,0.00014322979,0.00037902687,0.077353515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9872824,0.008022572,0.00031239018,0.0012588508,0.002615121,0.00050867844],"domain_scores_gemma":[0.9851998,0.009690297,0.00077360333,0.0013558845,0.0019634364,0.0010169372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014358251,0.0005586455,0.0007071263,0.0019063605,0.005378006,0.014865018,0.0020638283,0.0068491697,0.007268487],"category_scores_gemma":[0.023937574,0.00046243556,0.0005204565,0.0018996757,0.030633515,0.023517326,0.005001219,0.007227472,0.0013806794],"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.0000033914316,0.000007250602,0.000028170616,0.000013976074,0.0000015476544,0.00001740167,0.0005160433,0.000109767025,0.00002631403,0.9920637,0.0025162206,0.0046962877],"study_design_scores_gemma":[0.000005224039,0.000007956028,0.000037381425,0.0001011455,0.0000018674942,0.000028398232,0.0006205951,0.0004834435,0.00006214124,0.92613333,0.07251263,0.00000591098],"about_ca_topic_score_codex":0.0023722607,"about_ca_topic_score_gemma":0.0017328588,"teacher_disagreement_score":0.014865018,"about_ca_system_score_codex":0.0063545858,"about_ca_system_score_gemma":0.0077733947,"threshold_uncertainty_score":0.07593459},"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":"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.00374022,0.00011074431,0.9910343,0.0003884954,0.0001690939,0.0000884936,0.00007457781,0.00221484,0.0021792678],"genre_scores_gemma":[0.088705465,0.00039653463,0.9031468,0.00071609276,0.00028307745,0.00036233242,0.00032832456,0.0011011659,0.0049600806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980331,0.0004994325,0.0002437701,0.00040058876,0.0005913603,0.00023180386],"domain_scores_gemma":[0.99669075,0.0018458738,0.00026843592,0.00042732694,0.00066873204,0.00009892407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024990626,0.0008766339,0.00053388515,0.00069088844,0.0006930765,0.0023799853,0.0014733283,0.0010361405,0.0057884185],"category_scores_gemma":[0.005824564,0.0007001384,0.0012197613,0.000525002,0.0026911537,0.0028310632,0.0020581295,0.0025539899,0.0023805434],"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.00017934534,0.00025368732,0.0006370131,0.00073256716,0.000044306787,0.0012951089,0.0023680823,0.009658099,0.025474992,0.8278784,0.007747143,0.123731196],"study_design_scores_gemma":[0.00029956366,0.00097563385,0.0008673579,0.00048134738,0.00020413044,0.0035022292,0.0007144762,0.16751921,0.09852705,0.5074604,0.21923693,0.00021161832],"about_ca_topic_score_codex":0.0007322158,"about_ca_topic_score_gemma":0.00035169284,"teacher_disagreement_score":0.0057884185,"about_ca_system_score_codex":0.00079975615,"about_ca_system_score_gemma":0.001611398,"threshold_uncertainty_score":0.019364178},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022061619,0.975747,0.012343551,0.0011495063,0.0003019572,0.000059974813,0.00017410317,0.00032437447,0.0076933615],"genre_scores_gemma":[0.015221146,0.9598662,0.020507047,0.00030738686,0.00035718453,0.00012309912,0.00044269953,0.00013329127,0.0030419158],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972059,0.00087006163,0.0003002915,0.0003598853,0.0011283577,0.00013546394],"domain_scores_gemma":[0.9875723,0.007914924,0.00076397764,0.00036519478,0.0032321562,0.00015153889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032954924,0.0014201872,0.0015933439,0.011403832,0.0009308507,0.0034335912,0.0014486678,0.001261646,0.009280343],"category_scores_gemma":[0.0164629,0.0007080316,0.0013245814,0.015559336,0.0007522868,0.005433474,0.0010135816,0.00109695,0.002318415],"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.000056935616,0.00008481069,0.0007116647,0.014836937,0.00010546308,0.00013634666,0.00053761195,0.0007693062,0.0012103533,0.0046732905,0.016626725,0.9602506],"study_design_scores_gemma":[0.00006359586,0.0003436983,0.01124064,0.050643858,0.0008532801,0.0019806314,0.0022145184,0.005782473,0.0073228343,0.024281137,0.89509904,0.00017423197],"about_ca_topic_score_codex":0.0046800897,"about_ca_topic_score_gemma":0.00518974,"teacher_disagreement_score":0.011403832,"about_ca_system_score_codex":0.0012115354,"about_ca_system_score_gemma":0.0030426204,"threshold_uncertainty_score":0.031045854},"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":"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.00050840917,0.00014717923,0.996988,0.0005114025,0.00005413384,0.00009635457,0.000114446906,0.00020410948,0.001376078],"genre_scores_gemma":[0.048842624,0.00064981706,0.9459875,0.0005092383,0.000520051,0.00085997494,0.00049596385,0.00013330053,0.002001518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98975277,0.00441522,0.0015162397,0.0011416775,0.0027332285,0.0004408692],"domain_scores_gemma":[0.9739043,0.0153835295,0.00195941,0.0050752703,0.0030666187,0.00061081554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0157516,0.0016472937,0.001108877,0.004696234,0.0026481585,0.007703297,0.005216467,0.0029585457,0.004778301],"category_scores_gemma":[0.02390282,0.0015270014,0.0037743591,0.0030291248,0.009169709,0.013152774,0.0050194585,0.007087953,0.001664704],"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.000018974257,0.000057605543,0.00027853073,0.00019144507,0.000025629066,0.00024747345,0.0005029287,0.0071920287,0.0011428229,0.9767099,0.0011495361,0.01248309],"study_design_scores_gemma":[0.000044569035,0.000077905286,0.00020650536,0.00025472202,0.00007605324,0.00050328847,0.00030423672,0.09152467,0.0025267529,0.8587484,0.04566171,0.000071224575],"about_ca_topic_score_codex":0.0028568602,"about_ca_topic_score_gemma":0.0021331962,"teacher_disagreement_score":0.0157516,"about_ca_system_score_codex":0.0029524937,"about_ca_system_score_gemma":0.004444207,"threshold_uncertainty_score":0.08330339},"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":"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.20347355,0.0012236557,0.6525859,0.014718347,0.0007359775,0.0013717492,0.0010257944,0.021529092,0.10333592],"genre_scores_gemma":[0.8759864,0.00082921446,0.10276083,0.004015276,0.00048154348,0.0010807711,0.00068335404,0.0014639283,0.012698645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97023296,0.011310629,0.0029517235,0.0036527857,0.008503675,0.0033481685],"domain_scores_gemma":[0.8697612,0.05503166,0.00940793,0.052329574,0.0106016155,0.0028678956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03197404,0.0008782838,0.0011515756,0.0023249693,0.002669444,0.0076146135,0.0035510308,0.003967249,0.005575218],"category_scores_gemma":[0.096633725,0.001168612,0.00085666764,0.0014719989,0.0062706512,0.012526822,0.007890621,0.005209494,0.0018991288],"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.0005017547,0.00024005948,0.0071462826,0.00028407492,0.00008347208,0.0003844675,0.0020944562,0.02171776,0.0076701357,0.8530461,0.012840327,0.09399108],"study_design_scores_gemma":[0.00021433207,0.00025655812,0.0028431548,0.00089582265,0.00012561,0.00033261796,0.0011770639,0.13452832,0.037788287,0.6403045,0.18136966,0.00016408245],"about_ca_topic_score_codex":0.0036887778,"about_ca_topic_score_gemma":0.0025336805,"teacher_disagreement_score":0.03197404,"about_ca_system_score_codex":0.003709462,"about_ca_system_score_gemma":0.01060444,"threshold_uncertainty_score":0.16909689},"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":"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.014451824,0.029564843,0.65089405,0.17510812,0.008554795,0.00009063367,0.001052331,0.0020183416,0.118265115],"genre_scores_gemma":[0.48384023,0.01787325,0.3855605,0.04366736,0.019472659,0.0008573998,0.0011391633,0.0016796472,0.045909822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99523515,0.0021487945,0.00038719267,0.0011067988,0.000846979,0.00027509683],"domain_scores_gemma":[0.9890027,0.008492873,0.00030336928,0.0010381563,0.0009784041,0.00018453859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005540327,0.0007888001,0.00092342735,0.0024662053,0.0033990168,0.007057718,0.0024037918,0.0029864088,0.0078629535],"category_scores_gemma":[0.011063418,0.0004907299,0.0016918732,0.0018039535,0.017052677,0.013539356,0.0034750206,0.0070480504,0.0028900895],"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.00009017211,0.000014812091,0.00031628873,0.00047907475,0.00003303986,0.00040453096,0.003384513,0.00042625866,0.0016688932,0.95023555,0.016917612,0.02602935],"study_design_scores_gemma":[0.00002796418,0.000049863473,0.0005421076,0.00014959321,0.000027199361,0.00073329074,0.0009175921,0.0027863237,0.0016790595,0.81254214,0.18049201,0.000052899337],"about_ca_topic_score_codex":0.0024114994,"about_ca_topic_score_gemma":0.0013668584,"teacher_disagreement_score":0.0078629535,"about_ca_system_score_codex":0.0012822315,"about_ca_system_score_gemma":0.0008560116,"threshold_uncertainty_score":0.029300392},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006756345,0.0222625,0.14530337,0.06929319,0.012979811,0.00022425133,0.0018070063,0.008292549,0.7330811],"genre_scores_gemma":[0.1006329,0.027839605,0.14106524,0.021628346,0.008535849,0.00038328164,0.003061772,0.0030534198,0.6937996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953317,0.0011647558,0.000257985,0.0008205278,0.002156229,0.00026881078],"domain_scores_gemma":[0.9889346,0.0032408335,0.00035193897,0.0045484323,0.0024624155,0.00046188856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044678645,0.0010535523,0.00072376936,0.00356511,0.0025206448,0.010812608,0.0020644472,0.0020450826,0.08032217],"category_scores_gemma":[0.012209092,0.00056253,0.0011098773,0.0034679605,0.0028816056,0.01244136,0.00551361,0.004435681,0.03831361],"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.00014976024,0.00005662934,0.00034752706,0.00032073987,0.000027637363,0.00020511441,0.0004646283,0.0006547162,0.0016454873,0.41598985,0.18272077,0.39741716],"study_design_scores_gemma":[0.00001612386,0.000023466144,0.00025991342,0.00014822617,0.000013185489,0.00025150768,0.000120076256,0.0018381306,0.0014280454,0.08020034,0.9156832,0.00001772274],"about_ca_topic_score_codex":0.0031321994,"about_ca_topic_score_gemma":0.0026517438,"teacher_disagreement_score":0.08032217,"about_ca_system_score_codex":0.003165284,"about_ca_system_score_gemma":0.0034539846,"threshold_uncertainty_score":0.26870447},"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":"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.0009850983,0.0001833161,0.99701285,0.00029155254,0.0000326869,0.00004235744,0.000048903195,0.00028347314,0.0011197656],"genre_scores_gemma":[0.06877239,0.0012318213,0.92614293,0.00032832765,0.0002297894,0.00039187705,0.0002824087,0.00015362145,0.002466908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996494,0.0010626379,0.000319294,0.00040371512,0.0015468766,0.00017342818],"domain_scores_gemma":[0.9914526,0.005778181,0.0005787907,0.0014979974,0.00057552155,0.000116960306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004649323,0.001584894,0.0007142023,0.003126447,0.0011794751,0.0028338204,0.002467963,0.0015494794,0.0034581677],"category_scores_gemma":[0.010867771,0.001029982,0.0027685699,0.0015551362,0.0063135508,0.008566422,0.002875838,0.0047075255,0.0011433233],"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.000025134419,0.0000435098,0.00038077225,0.00033781267,0.000045325003,0.00025915154,0.0005048614,0.022905774,0.0037770513,0.9369366,0.0020019233,0.032782],"study_design_scores_gemma":[0.000036309815,0.00005200367,0.0001417463,0.00015591424,0.000059347924,0.00043624933,0.0000987148,0.12290643,0.0046051876,0.8402158,0.031241173,0.00005123894],"about_ca_topic_score_codex":0.0015708893,"about_ca_topic_score_gemma":0.0017041279,"teacher_disagreement_score":0.004649323,"about_ca_system_score_codex":0.0016547109,"about_ca_system_score_gemma":0.00196418,"threshold_uncertainty_score":0.024588287},"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":"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.044349696,0.0016378496,0.9394493,0.002848032,0.00017080085,0.000073826865,0.00017982005,0.0011339979,0.010156613],"genre_scores_gemma":[0.63154846,0.0014584855,0.3591997,0.00068311376,0.00035735557,0.00015912215,0.0005974441,0.000855467,0.005140892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99513054,0.001920354,0.00042001824,0.0008890405,0.0011860906,0.00045402092],"domain_scores_gemma":[0.9752303,0.018197756,0.0015100172,0.0033457393,0.0015075036,0.00020862267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051063085,0.0007748488,0.0012660982,0.0024781607,0.0018433796,0.00477057,0.0020489146,0.002795683,0.0046697105],"category_scores_gemma":[0.037492827,0.0009774142,0.001674911,0.002353374,0.005031719,0.015170015,0.0042125345,0.0038667857,0.0016009681],"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.0003795289,0.00007337071,0.0012489381,0.000401155,0.00006233683,0.0008719518,0.0018915393,0.015362776,0.023582812,0.72136503,0.003099325,0.23166125],"study_design_scores_gemma":[0.000042256135,0.000034995104,0.0005654509,0.000068630936,0.000063834384,0.00042768594,0.00018706796,0.057317402,0.016157633,0.91573983,0.009328437,0.0000667019],"about_ca_topic_score_codex":0.0009702131,"about_ca_topic_score_gemma":0.00056928734,"teacher_disagreement_score":0.0051063085,"about_ca_system_score_codex":0.0013371283,"about_ca_system_score_gemma":0.0015040017,"threshold_uncertainty_score":0.027005076},"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":"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.0035217914,0.0038097803,0.9232046,0.0053210864,0.0006260696,0.00024145606,0.00021457695,0.00075347663,0.06230715],"genre_scores_gemma":[0.111948624,0.018202754,0.8273376,0.0043166648,0.001533428,0.0016181574,0.0011036717,0.0009779383,0.032961212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99264103,0.0032891459,0.0005888282,0.00078460766,0.0022996222,0.00039673343],"domain_scores_gemma":[0.9909758,0.005296985,0.00060345005,0.0021199877,0.0007052743,0.00029852416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057917503,0.0032886348,0.001350039,0.0022881068,0.0032821158,0.007208474,0.0034705636,0.0063581457,0.010765853],"category_scores_gemma":[0.014197437,0.0016367782,0.002009418,0.0037031532,0.023093028,0.019677509,0.0083905645,0.0075728353,0.004052332],"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.000012871397,0.000009344256,0.00009232209,0.00021429386,0.000008369063,0.00014648051,0.00089911226,0.0019789254,0.00048314026,0.98228776,0.0018631186,0.012004243],"study_design_scores_gemma":[0.000030527754,0.000055414377,0.00020266375,0.0004791242,0.000029217732,0.0003965671,0.00050907675,0.005810502,0.0014185276,0.8371322,0.1538825,0.00005366931],"about_ca_topic_score_codex":0.00461609,"about_ca_topic_score_gemma":0.0057779886,"teacher_disagreement_score":0.010765853,"about_ca_system_score_codex":0.0020851307,"about_ca_system_score_gemma":0.0038073165,"threshold_uncertainty_score":0.03601533},"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":"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.010628825,0.0839489,0.57039076,0.042797696,0.002490788,0.00013056496,0.001009837,0.001108462,0.28749412],"genre_scores_gemma":[0.5270367,0.097024746,0.27696484,0.009861461,0.006145606,0.00047676064,0.002910974,0.00038194231,0.079196915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965249,0.0012568495,0.00032870815,0.0006902498,0.0010640997,0.00013527283],"domain_scores_gemma":[0.98475397,0.010253354,0.0006493446,0.0025388103,0.0012842698,0.00052034756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036449356,0.0005179116,0.0009456898,0.0037454083,0.0012518633,0.0088200085,0.0018631608,0.0019046231,0.013572156],"category_scores_gemma":[0.016160544,0.0004081641,0.0007325962,0.00287525,0.009987732,0.018689519,0.0033598228,0.0036129376,0.002975259],"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.00002097205,0.000028698843,0.00037242792,0.000484879,0.000041140218,0.00013034843,0.001245058,0.00057696935,0.000411352,0.90100336,0.010710009,0.084974684],"study_design_scores_gemma":[0.000004448147,0.000007321714,0.00018958049,0.00021739218,0.0000103728025,0.00009994439,0.00039004852,0.00089157996,0.00026069582,0.9160462,0.08187214,0.0000103859475],"about_ca_topic_score_codex":0.0027630932,"about_ca_topic_score_gemma":0.0028174222,"teacher_disagreement_score":0.013572156,"about_ca_system_score_codex":0.0020930085,"about_ca_system_score_gemma":0.003374548,"threshold_uncertainty_score":0.04540336},"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":"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.030908586,0.0012245066,0.93105656,0.0029128357,0.0004562277,0.0001358432,0.00034773603,0.0024099643,0.030547692],"genre_scores_gemma":[0.33692074,0.0020284592,0.60932446,0.0017818067,0.0010740587,0.00018343603,0.0017659765,0.0015994204,0.045321636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9920415,0.0020702367,0.0007071901,0.0014878116,0.003122313,0.00057087245],"domain_scores_gemma":[0.99340665,0.0024459725,0.00070454384,0.0015307913,0.0017946432,0.00011750822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042523313,0.001252149,0.0013722988,0.0028800538,0.0031752337,0.005262971,0.0024195472,0.002058684,0.0069081034],"category_scores_gemma":[0.011902526,0.0010929597,0.00089521933,0.0028660614,0.002193571,0.011842329,0.0056843897,0.0029989078,0.004514494],"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.00020526211,0.00011782672,0.0026571697,0.0006653525,0.00010416056,0.0014002514,0.0072097606,0.006435109,0.030050414,0.5652947,0.027038068,0.35882193],"study_design_scores_gemma":[0.000042320007,0.00006312497,0.00054109347,0.00019593353,0.00013216725,0.0010707013,0.00251758,0.045772806,0.044532314,0.6254976,0.2795443,0.00009008563],"about_ca_topic_score_codex":0.0010941369,"about_ca_topic_score_gemma":0.0013421164,"teacher_disagreement_score":0.0069081034,"about_ca_system_score_codex":0.0013833954,"about_ca_system_score_gemma":0.0015775934,"threshold_uncertainty_score":0.023109853},"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":"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.0048213103,0.00006462313,0.98838377,0.00049351476,0.00005322008,0.00026597633,0.00015304412,0.0008045788,0.004959936],"genre_scores_gemma":[0.24316312,0.00030208315,0.7463142,0.0005917463,0.00017262531,0.0006769604,0.0009937218,0.00036098566,0.007424576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9897877,0.0034860945,0.0009884466,0.0019947253,0.0031078735,0.0006351157],"domain_scores_gemma":[0.9855385,0.010953111,0.00041827976,0.0014225077,0.0013462473,0.00032142375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008173892,0.0008093713,0.0007892306,0.0017115803,0.0017026853,0.0035000078,0.0020866413,0.002016144,0.011434423],"category_scores_gemma":[0.021117067,0.0007084338,0.0030240342,0.0013716612,0.0045596166,0.0071994844,0.004318518,0.0053304634,0.0031608862],"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.00016551405,0.000107575885,0.0002415903,0.0001399466,0.000050203023,0.00017408666,0.00045169998,0.00848692,0.003461509,0.93987805,0.0021138147,0.044729125],"study_design_scores_gemma":[0.00010508559,0.000092589864,0.00007154326,0.00004328122,0.000051299197,0.00013211746,0.00007607451,0.08580325,0.008757193,0.89410084,0.01072659,0.000040141087],"about_ca_topic_score_codex":0.0008364513,"about_ca_topic_score_gemma":0.00069748587,"teacher_disagreement_score":0.011434423,"about_ca_system_score_codex":0.0015575152,"about_ca_system_score_gemma":0.0026263376,"threshold_uncertainty_score":0.04322821},"labels":[],"label_agreement":null}]}