{"meta":{"query_hash":"a5e740faf4ed","filters":{"venue":"Journal of Cryptology"},"cohort_total":21,"direct_labels_cover":0,"predictions_cover":21,"exported":21,"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/a5e740faf4ed","api":"https://metacan.xera.ac/api/v1/cohort?venue=Journal+of+Cryptology"},"results":[{"id":"W162865231","doi":"10.1007/s00145-002-0107-y","title":"A Probable Prime Test with Very High Confidence for n ≡ 3 mod 4","year":2003,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Austrian Science Fund","keywords":"Precomputation; Mathematics; Mod; Modulo; Prime (order theory); Arithmetic; Primality test; Square root; Discrete mathematics; Combinatorics; Prime number; Algorithm; Computer science","score_opus":0.008341506126372444,"score_gpt":0.22202805433775705,"score_spread":0.2136865482113846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W162865231","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68155736,0.001453642,0.2586142,0.018073814,0.0012080256,0.00029218223,0.002237184,0.0017923919,0.034771223],"genre_scores_gemma":[0.9768463,0.000077103585,0.019824661,0.0010805763,0.00050133164,0.00005601055,0.0005872454,0.00004207682,0.0009846545],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9790495,0.008502081,0.0011650035,0.004341229,0.005273205,0.0016690244],"domain_scores_gemma":[0.63069445,0.32294852,0.009302214,0.023033975,0.007842997,0.0061779115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02077532,0.001205155,0.0016548234,0.0037615234,0.003186122,0.0038748095,0.003964232,0.008126307,0.017547265],"category_scores_gemma":[0.20259967,0.00092016975,0.0017377356,0.001993756,0.006890917,0.0059655774,0.003504181,0.0040305518,0.0031789248],"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.02768623,0.0012603303,0.41222697,0.001885702,0.002098121,0.013908865,0.0022274822,0.028926428,0.02751834,0.26429954,0.032074288,0.18588766],"study_design_scores_gemma":[0.0032442163,0.002597542,0.060899064,0.0003589885,0.00089713285,0.026706107,0.0013577017,0.18916474,0.04730095,0.6424224,0.024541967,0.0005093339],"about_ca_topic_score_codex":0.0003928274,"about_ca_topic_score_gemma":0.00036324657,"teacher_disagreement_score":0.02077532,"about_ca_system_score_codex":0.00066322443,"about_ca_system_score_gemma":0.0014751203,"threshold_uncertainty_score":0.109871686},"labels":[],"label_agreement":null},{"id":"W1809690300","doi":"10.1007/s00145-001-0010-y","title":"Almost k -Wise Independent Sample Spaces and Their Cryptologic Applications","year":2001,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Vetenskapsrådet","keywords":"Mathematics; Pseudorandom number generator; Block cipher; Hash function; Discrete mathematics; Random oracle; Key (lock); Decorrelation; Random function; Combinatorics; Random variable; Algorithm; Cryptography; Computer science; Encryption; Public-key cryptography; Statistics","score_opus":0.015516179908635358,"score_gpt":0.2484218251798251,"score_spread":0.23290564527118976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1809690300","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.10656305,0.0048887488,0.85015893,0.005913618,0.00033710542,0.00008893492,0.00046545354,0.00045434714,0.031129757],"genre_scores_gemma":[0.86740494,0.0029828532,0.112745926,0.0009041522,0.0013888737,0.000288707,0.00040921892,0.0001471927,0.013728146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943897,0.0028901882,0.00019972151,0.0006629093,0.0014398653,0.00041749777],"domain_scores_gemma":[0.95521116,0.035439007,0.0025309485,0.0042331163,0.0013692406,0.0012164732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058751726,0.0011239642,0.0015506536,0.0036709984,0.0018102214,0.004457425,0.0020351675,0.0022554917,0.0044814143],"category_scores_gemma":[0.03705792,0.0011567915,0.0012514956,0.0045811017,0.007968412,0.0102821365,0.0061184587,0.0056192954,0.0007322242],"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.000121899386,0.000021639207,0.0002844329,0.000045689387,0.000020561403,0.000044599168,0.00010555792,0.0041269013,0.00023894207,0.98422074,0.0009673034,0.009801797],"study_design_scores_gemma":[0.000023004013,0.000024376248,0.00015391591,0.000019319295,0.000011867861,0.00014223442,0.000035184683,0.02780909,0.00048859365,0.96964025,0.0016336732,0.000018457873],"about_ca_topic_score_codex":0.00029643517,"about_ca_topic_score_gemma":0.00026909533,"teacher_disagreement_score":0.0058751726,"about_ca_system_score_codex":0.001841522,"about_ca_system_score_gemma":0.0012774136,"threshold_uncertainty_score":0.031071246},"labels":[],"label_agreement":null},{"id":"W1899845837","doi":"10.1007/s00145-001-0007-6","title":"Complexity Bounds on General Hard-Core Predicates","year":2001,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Kungliga Tekniska Högskolan; McGill University; University of Texas at Austin; National Science Foundation","keywords":"Predicate (mathematical logic); Boolean function; Mathematics; Discrete mathematics; Combinatorics; Monotone polygon; Core (optical fiber); Hard core; Computer science","score_opus":0.08349018298500696,"score_gpt":0.30711456702709455,"score_spread":0.2236243840420876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1899845837","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.25090444,0.009193669,0.46861434,0.03648305,0.0013472544,0.0008315144,0.0055383802,0.0035506245,0.22353666],"genre_scores_gemma":[0.8799818,0.006183045,0.07145858,0.0048664683,0.0030111275,0.00080424297,0.0049548494,0.0025755514,0.026164366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98994774,0.001691599,0.00034171058,0.0018191069,0.003058449,0.0031413054],"domain_scores_gemma":[0.88144433,0.09748183,0.002768735,0.010927817,0.0035028376,0.0038743676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007107592,0.0029334186,0.004481378,0.005472562,0.0051756576,0.013170085,0.007371981,0.0048081004,0.024849873],"category_scores_gemma":[0.054252263,0.0024132587,0.00420678,0.0070292572,0.007771983,0.050775968,0.011973813,0.016565407,0.003371576],"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.0018761888,0.0005793921,0.0025269086,0.00084485195,0.00016258,0.00018710953,0.00063410297,0.047868636,0.0037690422,0.8727549,0.03035945,0.03843694],"study_design_scores_gemma":[0.00011228374,0.000056275207,0.00054658024,0.00006934298,0.00010525311,0.00011790374,0.00010345315,0.06271227,0.0015146023,0.9306458,0.0039745243,0.00004168643],"about_ca_topic_score_codex":0.0034266065,"about_ca_topic_score_gemma":0.004804506,"teacher_disagreement_score":0.024849873,"about_ca_system_score_codex":0.0100945225,"about_ca_system_score_gemma":0.0056784847,"threshold_uncertainty_score":0.083131075},"labels":[],"label_agreement":null},{"id":"W2000932900","doi":"10.1007/s00145-007-9002-x","title":"Cryptographic Hash Functions from Expander Graphs","year":2007,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":366,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Hash function; Collision resistance; Expander graph; Mathematics; Ramanujan's sum; Double hashing; Discrete mathematics; Rolling hash; SWIFFT; Combinatorics; Perfect hash function; Cryptographic hash function; Cryptography; Graph; Computer science; Algorithm","score_opus":0.05928752648007167,"score_gpt":0.3675170399643483,"score_spread":0.30822951348427663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000932900","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.20492199,0.0016390149,0.73021686,0.0048136227,0.00052268547,0.00033620253,0.0007151376,0.0019634773,0.054871004],"genre_scores_gemma":[0.88146627,0.0014462249,0.08560733,0.001239271,0.0008861529,0.00028770682,0.00076377025,0.0005802616,0.027722998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998889,0.0003395621,0.00005196628,0.00014266686,0.00044105417,0.00013575057],"domain_scores_gemma":[0.9923644,0.0052108904,0.00046343807,0.0014008874,0.00033563405,0.00022467763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001370174,0.0007940476,0.0008544343,0.0022168178,0.0010347723,0.0025766178,0.00108221,0.0016250955,0.008531124],"category_scores_gemma":[0.009050383,0.0007306395,0.0007394644,0.0018100827,0.0027523101,0.00886441,0.0040764436,0.0036157884,0.0017801074],"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.0002431019,0.000047388305,0.00025202506,0.00008894812,0.000016137474,0.000117463824,0.00023337935,0.00794162,0.0030643514,0.95227873,0.0034991568,0.032217745],"study_design_scores_gemma":[0.00004086067,0.00003868902,0.00011921841,0.000022069074,0.000014648105,0.00016805039,0.000032700227,0.02138347,0.003483309,0.97067386,0.004001327,0.000021907359],"about_ca_topic_score_codex":0.00018239496,"about_ca_topic_score_gemma":0.00024596465,"teacher_disagreement_score":0.008531124,"about_ca_system_score_codex":0.0009426896,"about_ca_system_score_gemma":0.00054398377,"threshold_uncertainty_score":0.028539479},"labels":[],"label_agreement":null},{"id":"W2018263239","doi":"10.1007/s00145-004-0142-y","title":"Efficient Quantum Key Distribution Scheme and a Proof of Its Unconditional Security","year":2004,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":558,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Ontario Innovation Trust","keywords":"Eavesdropping; Quantum key distribution; BB84; Mathematical proof; Mathematics; Scheme (mathematics); Key (lock); Theoretical computer science; Security analysis; Computer science; Quantum cryptography; Quantum; Computer security; Quantum information; Quantum mechanics","score_opus":0.00828184864086077,"score_gpt":0.24102522012492972,"score_spread":0.23274337148406896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018263239","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.080722064,0.0010752848,0.8104371,0.012326767,0.0010933306,0.0006860555,0.000981205,0.0011642018,0.091514036],"genre_scores_gemma":[0.8614417,0.0007065686,0.11216385,0.0015740055,0.00065473607,0.0005988783,0.0003480819,0.00017486322,0.02233718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957366,0.00090428215,0.00023419353,0.00063491,0.0016923015,0.0007976754],"domain_scores_gemma":[0.9923522,0.0044333353,0.00039103322,0.0015292832,0.0007983306,0.00049582595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003294307,0.0011026248,0.0017711906,0.0015623196,0.0037598924,0.0042703995,0.0023895008,0.0038168828,0.0086259395],"category_scores_gemma":[0.008619491,0.0014431681,0.002054954,0.0019201281,0.007281849,0.007226405,0.007915758,0.00764887,0.0023689813],"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.00015678468,0.00008788703,0.000116679934,0.000072891475,0.000028903345,0.0001008094,0.00020671258,0.0023592922,0.0026794,0.9850131,0.0026580628,0.006519398],"study_design_scores_gemma":[0.00015615489,0.00008998077,0.00021170879,0.000044999462,0.00005215934,0.00020478817,0.000039498107,0.023015816,0.00474401,0.96335363,0.008017632,0.000069586284],"about_ca_topic_score_codex":0.00072970183,"about_ca_topic_score_gemma":0.00057655154,"teacher_disagreement_score":0.0086259395,"about_ca_system_score_codex":0.002869361,"about_ca_system_score_gemma":0.0039306437,"threshold_uncertainty_score":0.028856695},"labels":[],"label_agreement":null},{"id":"W2021553056","doi":"10.1007/s00145-009-9048-z","title":"A Taxonomy of Pairing-Friendly Elliptic Curves","year":2009,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":467,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Defense Science and Engineering Graduate; Division of Mathematical Sciences; Directorate for Mathematical and Physical Sciences; Science Foundation Ireland; National Science Foundation","keywords":"Pairing; Embedding; Elliptic curve; Mathematics; Cryptography; Computer science; Pure mathematics; Theoretical computer science; Physics; Algorithm; Artificial intelligence; Superconductivity; Quantum mechanics","score_opus":0.014433676744522023,"score_gpt":0.23952514866171412,"score_spread":0.2250914719171921,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021553056","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.09870838,0.014287202,0.7200987,0.003584358,0.00080439163,0.0012310402,0.0012280887,0.0020497302,0.15800817],"genre_scores_gemma":[0.408436,0.024168028,0.5342545,0.0010548544,0.00081861916,0.0009758609,0.00219036,0.00041713918,0.027684592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962255,0.00075914507,0.00058216223,0.000499872,0.0014814989,0.00045182888],"domain_scores_gemma":[0.99663454,0.00061736075,0.0005078559,0.0011231508,0.00070675806,0.00041029564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025179642,0.0015155374,0.0009791483,0.005322881,0.0030926927,0.0046361964,0.0013272478,0.0021360097,0.0035587598],"category_scores_gemma":[0.0058422955,0.0007010254,0.0010917521,0.0054851165,0.0031174612,0.009326097,0.004007085,0.0038284368,0.0020166086],"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.000038644863,0.000053479285,0.0013637803,0.00020607832,0.000010434983,0.00031915234,0.00072154915,0.0015778602,0.002045849,0.93964326,0.0028948109,0.051125236],"study_design_scores_gemma":[0.00002966184,0.00027809304,0.0013474918,0.00049488456,0.000028676295,0.004916003,0.0007070812,0.008386095,0.0042780726,0.6644677,0.31495714,0.00010911528],"about_ca_topic_score_codex":0.00033912036,"about_ca_topic_score_gemma":0.0002038178,"teacher_disagreement_score":0.005322881,"about_ca_system_score_codex":0.0010131795,"about_ca_system_score_gemma":0.0015739639,"threshold_uncertainty_score":0.0133164525},"labels":[],"label_agreement":null},{"id":"W2022521688","doi":"10.1007/s001450010009","title":"CBC MAC for Real-Time Data Sources","year":2000,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":144,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Iran Telecommunication Research Center; University of Toronto; Ontario Centres of Excellence","keywords":"CBC-MAC; Computer science; Message authentication code; Message broker; Chaining; Authentication (law); Encryption; Computer network; Cryptography; Theoretical computer science; Computer security; Block cipher","score_opus":0.03463365323646356,"score_gpt":0.32714692013608354,"score_spread":0.29251326689962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022521688","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.013432796,0.001647306,0.95630676,0.0013681004,0.0008966683,0.0002863113,0.0004099812,0.010406832,0.015245251],"genre_scores_gemma":[0.46771026,0.001034848,0.48368153,0.001897671,0.0009537287,0.00072699983,0.0013419949,0.0013617675,0.041291047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957955,0.0006406135,0.00043858745,0.00056047225,0.0020846706,0.0004802137],"domain_scores_gemma":[0.9845405,0.0024035154,0.0010686539,0.007572729,0.0040206057,0.00039395454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003996875,0.0010502792,0.0009904584,0.0026545413,0.0018962737,0.0047141006,0.002317321,0.0021059117,0.014273995],"category_scores_gemma":[0.015727289,0.00055927073,0.0005744502,0.0018847721,0.0019125111,0.0051010307,0.002943924,0.002949184,0.006479819],"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.0027203802,0.00016700193,0.0016646138,0.0009249804,0.0001538388,0.00063783873,0.0006171089,0.009396793,0.047424957,0.532286,0.05641059,0.347596],"study_design_scores_gemma":[0.00041644447,0.0005226763,0.0013393074,0.0007626007,0.00033476713,0.0016674794,0.00022781896,0.31368506,0.17286478,0.29168552,0.21621367,0.00027987515],"about_ca_topic_score_codex":0.0018138264,"about_ca_topic_score_gemma":0.0017684308,"teacher_disagreement_score":0.014273995,"about_ca_system_score_codex":0.002793375,"about_ca_system_score_gemma":0.0034769333,"threshold_uncertainty_score":0.047751307},"labels":[],"label_agreement":null},{"id":"W2029492597","doi":"10.1007/s00145-005-0011-3","title":"A Proof of the Security of Quantum Key Distribution","year":2006,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":149,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Army Research Office; European Commission; Natural Sciences and Engineering Research Council of Canada; Advanced Research Projects Agency; Defense Advanced Research Projects Agency; Deutscher Akademischer Austauschdienst","keywords":"Quantum key distribution; Key (lock); Computer science; Quantum cryptography; Computer security; Computation; Quantum; Key distribution; Quantum computer; Channel (broadcasting); Theoretical computer science; Computer network; Public-key cryptography; Quantum mechanics; Physics; Quantum information; Algorithm; Encryption","score_opus":0.005146683076329867,"score_gpt":0.21554909142363096,"score_spread":0.2104024083473011,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029492597","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.061874826,0.004942789,0.6316236,0.059008583,0.005876723,0.0004254144,0.0014664043,0.0012094831,0.23357216],"genre_scores_gemma":[0.8620559,0.0026616887,0.0932358,0.0064690667,0.0040211035,0.0004179054,0.0005255009,0.00033869778,0.030274391],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964393,0.0008482649,0.00016415677,0.0005338437,0.0014470414,0.0005673488],"domain_scores_gemma":[0.97971904,0.014692567,0.0007366344,0.0023813313,0.0016928695,0.0007775741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033311667,0.001362838,0.0016637993,0.0019753792,0.0035002523,0.0039519877,0.0025368987,0.0042512286,0.015996525],"category_scores_gemma":[0.01531583,0.0012558714,0.002470474,0.0017686969,0.009870153,0.008475524,0.008143683,0.009252172,0.0033247704],"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.00012983783,0.00004832724,0.00010101073,0.00011944305,0.0000351879,0.00013367996,0.00014501471,0.0015321245,0.0013537937,0.9830687,0.00622629,0.0071065887],"study_design_scores_gemma":[0.00009809228,0.00003323136,0.000099030905,0.0000398973,0.000020414327,0.00009118414,0.00002614563,0.0053270115,0.0011440823,0.9837794,0.009314244,0.000027344888],"about_ca_topic_score_codex":0.0010060252,"about_ca_topic_score_gemma":0.0005474281,"teacher_disagreement_score":0.015996525,"about_ca_system_score_codex":0.002318179,"about_ca_system_score_gemma":0.0025049078,"threshold_uncertainty_score":0.053513706},"labels":[],"label_agreement":null},{"id":"W2030480083","doi":"10.1007/s00145-014-9194-9","title":"Limits on the Usefulness of Random Oracles","year":2014,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Israeli Centers for Research Excellence; Azrieli Foundation; Israel Science Foundation; Bar-Ilan University","keywords":"Impossibility; Random oracle; Oracle; Computer science; Key (lock); Black box; Protocol (science); Theoretical computer science; Product (mathematics); Computer security; Public-key cryptography; Mathematics; Encryption; Artificial intelligence; Programming language","score_opus":0.02843023898195536,"score_gpt":0.24745341478355445,"score_spread":0.21902317580159908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030480083","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.29594105,0.027074318,0.45859542,0.042869866,0.0008292562,0.00022694701,0.0010952374,0.0026634268,0.17070447],"genre_scores_gemma":[0.9678092,0.00485912,0.017574046,0.0013114314,0.0017562116,0.00019731406,0.00019121106,0.0005775231,0.005723955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9561275,0.021982897,0.0022624638,0.0040525924,0.011665235,0.0039092633],"domain_scores_gemma":[0.29401338,0.63448757,0.0076267924,0.048790853,0.01018228,0.0048990506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.04595279,0.0020377522,0.0039975774,0.007068054,0.0021036472,0.012542481,0.0066635637,0.008084119,0.009737061],"category_scores_gemma":[0.29776475,0.002499715,0.002078083,0.0037376601,0.014070221,0.04050466,0.01179396,0.012392022,0.0025070095],"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.0010666037,0.00014811766,0.0014009415,0.00043325435,0.000076521894,0.00025493244,0.00062451453,0.014949249,0.0021442603,0.94499433,0.003164712,0.03074255],"study_design_scores_gemma":[0.00014640595,0.0001659666,0.0006013764,0.00031462385,0.00008275289,0.000686358,0.00010565719,0.07811643,0.0023855255,0.9133359,0.0039851726,0.00007375849],"about_ca_topic_score_codex":0.00039959955,"about_ca_topic_score_gemma":0.0002327707,"teacher_disagreement_score":0.04595279,"about_ca_system_score_codex":0.0024093427,"about_ca_system_score_gemma":0.0020347163,"threshold_uncertainty_score":0.24302447},"labels":[],"label_agreement":null},{"id":"W2033966971","doi":"10.1007/s00145-002-0146-4","title":"Oblivious Transfers and Privacy Amplification","year":2003,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Communication source; Oblivious transfer; Computer science; String (physics); Constraint (computer-aided design); Theoretical computer science; Task (project management); Cryptography; Algorithm; Mathematics; Computer network","score_opus":0.011605461127241784,"score_gpt":0.23816549144257557,"score_spread":0.22656003031533378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033966971","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.15801996,0.0016367107,0.6794756,0.015263007,0.00049935456,0.00032439557,0.00038826696,0.0016367771,0.14275602],"genre_scores_gemma":[0.9452035,0.0006274146,0.018743915,0.0007564566,0.00032230443,0.00020682935,0.00010186708,0.00024103992,0.033796676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934581,0.0025246746,0.0002643865,0.0007069715,0.001798455,0.0012475004],"domain_scores_gemma":[0.97255,0.018818354,0.0012659912,0.0060672355,0.00084431143,0.00045402447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040364,0.0011795262,0.0014953684,0.0018531176,0.0030932762,0.0050363047,0.0023692844,0.003449956,0.01258797],"category_scores_gemma":[0.023465302,0.0015010772,0.0016481228,0.002648447,0.009637493,0.017932873,0.008395835,0.007682215,0.0021528578],"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.00023216926,0.000046266894,0.00014628662,0.000044355853,0.000015986438,0.00010622755,0.00031840176,0.00629859,0.00091459753,0.98218393,0.0016562304,0.008036984],"study_design_scores_gemma":[0.000019966263,0.000011025271,0.000031935466,0.000009819593,0.000012798787,0.00009409201,0.000030092891,0.012084522,0.0015224868,0.98484856,0.0013234932,0.000011191186],"about_ca_topic_score_codex":0.00047038254,"about_ca_topic_score_gemma":0.00030967675,"teacher_disagreement_score":0.01258797,"about_ca_system_score_codex":0.0027676313,"about_ca_system_score_gemma":0.002029422,"threshold_uncertainty_score":0.04211092},"labels":[],"label_agreement":null},{"id":"W2035912926","doi":"10.1007/s001459910005","title":"Randomness versus Fault-Tolerance","year":2000,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Randomness; Correctness; Fault tolerance; Computer science; Resilience (materials science); Upper and lower bounds; Function (biology); Polynomial; Protocol (science); State (computer science); Discrete mathematics; Theoretical computer science; Algorithm; Mathematics; Distributed computing; Statistics; Physics","score_opus":0.012348127025442855,"score_gpt":0.26056062724421264,"score_spread":0.24821250021876978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035912926","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.19984356,0.02041864,0.6018415,0.048558023,0.0039878082,0.00014609001,0.00027532177,0.0011835318,0.12374559],"genre_scores_gemma":[0.9671942,0.0019188862,0.017961392,0.0012525788,0.0015976877,0.00007075697,0.000054630516,0.00014367126,0.009806218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963741,0.001435603,0.00020912207,0.0005194768,0.0010356564,0.00042604588],"domain_scores_gemma":[0.9680815,0.020428775,0.0017342529,0.007860593,0.0012378648,0.00065704645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036631948,0.00058500306,0.0012971702,0.0012976051,0.0014887204,0.0039367685,0.001611784,0.0035233381,0.005691571],"category_scores_gemma":[0.022282476,0.00046003502,0.0006123167,0.001347979,0.009488245,0.014896116,0.002876188,0.0049523613,0.0009937694],"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.00012524547,0.000017234766,0.00027895332,0.00006294279,0.0000138747255,0.000048233873,0.00012217091,0.0053302934,0.0004403271,0.97722673,0.0014937861,0.0148402285],"study_design_scores_gemma":[0.000029682426,0.00006876996,0.000100322366,0.00003411663,0.000020442285,0.00017976786,0.00006695727,0.007997344,0.0011712023,0.98392767,0.00638703,0.00001675393],"about_ca_topic_score_codex":0.00016660496,"about_ca_topic_score_gemma":0.00011776447,"teacher_disagreement_score":0.005691571,"about_ca_system_score_codex":0.0011705189,"about_ca_system_score_gemma":0.0008071209,"threshold_uncertainty_score":0.01937306},"labels":[],"label_agreement":null},{"id":"W2039510779","doi":"10.1007/s00145-008-9025-y","title":"New Binding-Concealing Trade-Offs for Quantum String Commitment","year":2008,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Army Research Office; Deutscher Akademischer Austauschdienst","keywords":"Commitment scheme; Commit; String (physics); Alice (programming language); Cheating; Alice and Bob; Qubit; Protocol (science); Coin flipping; Computer science; Bit array; Scheme (mathematics); Discrete mathematics; Quantum; Mathematics; Cryptography; Physics; Computer security; Theoretical physics; Quantum mechanics; Statistics; Psychology; Social psychology","score_opus":0.027778373236847367,"score_gpt":0.27185279765684867,"score_spread":0.2440744244200013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039510779","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.112370804,0.002020504,0.7975247,0.008019657,0.0006078961,0.00022468274,0.00027465713,0.0009621482,0.07799494],"genre_scores_gemma":[0.90221214,0.0006647893,0.081894465,0.0007390934,0.00042518685,0.00019910572,0.00009316808,0.000489158,0.013283011],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99037266,0.0042141676,0.0004967476,0.0011231807,0.0026970236,0.0010961285],"domain_scores_gemma":[0.9412542,0.041096978,0.0020876809,0.011601009,0.0021834164,0.0017766758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0145215625,0.0013040514,0.002734682,0.0020844094,0.0034888247,0.009528658,0.0061275153,0.00780168,0.018259447],"category_scores_gemma":[0.06640819,0.0020226287,0.0015162381,0.0028656675,0.010656954,0.024097262,0.008436715,0.012952195,0.0022474602],"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.00031733772,0.00006586282,0.0001343267,0.000058402224,0.000019239955,0.00004577285,0.00013571895,0.0128970435,0.0014224417,0.9698713,0.001610878,0.013421582],"study_design_scores_gemma":[0.000037011752,0.0000314135,0.000050027542,0.00002144367,0.000014702951,0.000045590747,0.000032436034,0.07369341,0.0007272882,0.9246214,0.00069713977,0.000028145483],"about_ca_topic_score_codex":0.0004311062,"about_ca_topic_score_gemma":0.00066320354,"teacher_disagreement_score":0.018259447,"about_ca_system_score_codex":0.004002431,"about_ca_system_score_gemma":0.0026228963,"threshold_uncertainty_score":0.07679832},"labels":[],"label_agreement":null},{"id":"W2069859460","doi":"10.1007/s00145-010-9087-5","title":"Fault-Based Attack on Montgomery’s Ladder Algorithm","year":2010,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"NIST; Elliptic curve cryptography; Elliptic curve; Scalar multiplication; Algorithm; Elliptic curve point multiplication; Elliptic Curve Digital Signature Algorithm; Computer science; Cryptography; Tripling-oriented Doche–Icart–Kohel curve; Curve25519; Mathematics; Arithmetic; Discrete mathematics; Computer security; Public-key cryptography; Pure mathematics; Speech recognition; Encryption","score_opus":0.015049916811778414,"score_gpt":0.2784208209006182,"score_spread":0.2633709040888398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069859460","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6297041,0.0008309886,0.32285234,0.003087322,0.0003510189,0.00011935741,0.00020132933,0.002900272,0.03995318],"genre_scores_gemma":[0.9732956,0.000118354685,0.02190859,0.00016044098,0.00003119044,0.000018787285,0.00006410204,0.000037645175,0.0043652495],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890137,0.0002322331,0.00005765851,0.00013365397,0.00042229655,0.00025283638],"domain_scores_gemma":[0.99876815,0.00040579366,0.00013624084,0.00039810833,0.00021085098,0.00008087961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065191626,0.00044787946,0.00062373007,0.0012017557,0.0009018738,0.00085756194,0.0007128284,0.0015847832,0.0039504883],"category_scores_gemma":[0.0025396394,0.00020898727,0.0004782512,0.0009492026,0.0008441745,0.0016072569,0.0015835803,0.0007859584,0.0009239959],"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.004209715,0.00041713874,0.007655593,0.00039791476,0.00029725712,0.0025086896,0.000983812,0.07356071,0.16291268,0.3523677,0.013398318,0.3812905],"study_design_scores_gemma":[0.00049193285,0.0014915594,0.0040426566,0.00016779227,0.000267402,0.003127282,0.0002341258,0.542316,0.1657685,0.2587916,0.023138968,0.00016216321],"about_ca_topic_score_codex":0.0007708248,"about_ca_topic_score_gemma":0.0007053165,"teacher_disagreement_score":0.0039504883,"about_ca_system_score_codex":0.0009413796,"about_ca_system_score_gemma":0.0008902849,"threshold_uncertainty_score":0.013215661},"labels":[],"label_agreement":null},{"id":"W2071265330","doi":"10.1007/s00145-012-9133-6","title":"Round-Optimal Password-Based Authenticated Key Exchange","year":2012,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Authenticated Key Exchange; Computer science; Password; Key (lock); Cryptosystem; Key exchange; Computer security; Bilinear interpolation; Protocol (science); Zero-knowledge password proof; Standard Model (mathematical formulation); Theoretical computer science; String (physics); Password strength; Cryptography; One-time password; Public-key cryptography; Encryption; Mathematics","score_opus":0.022374365796460675,"score_gpt":0.2993250014757068,"score_spread":0.2769506356792461,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071265330","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.06553004,0.000467971,0.9152879,0.0006158824,0.00022840081,0.0003065808,0.0005000784,0.0019857723,0.015077461],"genre_scores_gemma":[0.86412853,0.00017605067,0.127581,0.00011674786,0.000066729655,0.00011903462,0.0003840371,0.0001134377,0.007314341],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99442405,0.001472137,0.0004916609,0.00078068,0.001748406,0.001083127],"domain_scores_gemma":[0.99536705,0.0012184981,0.00031137283,0.0022688475,0.0005947542,0.00023953582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021297622,0.0005891543,0.0018287584,0.0007420074,0.0010985887,0.0019222038,0.002077904,0.0018755712,0.0076288055],"category_scores_gemma":[0.00625964,0.00063259853,0.0005926992,0.0009937854,0.0011860168,0.004039048,0.0053235525,0.0014399196,0.0035067794],"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.009340987,0.0006793532,0.0017553389,0.0005629856,0.00025399352,0.0007943201,0.0007460972,0.13636342,0.09293034,0.36537778,0.016854463,0.37434092],"study_design_scores_gemma":[0.00054508686,0.00064218167,0.00090236,0.000064520405,0.00010667241,0.0008843365,0.00015721949,0.7164053,0.063594125,0.20607273,0.010433529,0.00019197023],"about_ca_topic_score_codex":0.00042067986,"about_ca_topic_score_gemma":0.00067717035,"teacher_disagreement_score":0.0076288055,"about_ca_system_score_codex":0.00083422696,"about_ca_system_score_gemma":0.0022305462,"threshold_uncertainty_score":0.025520861},"labels":[],"label_agreement":null},{"id":"W2087377210","doi":"10.1007/s00145-001-0018-3","title":"New Approaches to Designing Public Key Cryptosystems Using One-Way Functions and Trapdoors in Finite Groups","year":2002,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":123,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo; National Science Foundation","keywords":"ElGamal encryption; Discrete logarithm; Cryptosystem; Signature (topology); Key (lock); ElGamal signature scheme; Mathematics; Public-key cryptography; Permutation (music); Hybrid cryptosystem; Theoretical computer science; Computer science; Cryptography; Discrete mathematics; Blind signature; Algorithm; Encryption; Computer security","score_opus":0.1943988686853836,"score_gpt":0.24220270297843846,"score_spread":0.04780383429305485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087377210","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.012342716,0.0004335371,0.98211503,0.00051908457,0.00009197449,0.00007771672,0.000017748212,0.00043771704,0.003964404],"genre_scores_gemma":[0.22475523,0.0010174415,0.7665882,0.0004024907,0.00022450372,0.00031365565,0.00006803781,0.00029568165,0.006334623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974929,0.0007436127,0.00019866989,0.00035442822,0.000977342,0.00023299121],"domain_scores_gemma":[0.9949705,0.0024956854,0.00027209887,0.0016854923,0.0004327336,0.00014353338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034377445,0.0012936402,0.0011995038,0.001934309,0.0018627191,0.0035338441,0.0026554249,0.0020346234,0.0037014103],"category_scores_gemma":[0.006253029,0.001418343,0.0018962836,0.0013468985,0.0060405266,0.0156843,0.0036294316,0.0050314018,0.001251032],"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.00016399095,0.00012852171,0.00026159684,0.00031864172,0.00005452825,0.00008976455,0.00057823217,0.015357176,0.009886484,0.9112817,0.0013328829,0.060546506],"study_design_scores_gemma":[0.00011138256,0.00014300247,0.00005377275,0.00007805124,0.000092848626,0.00024560862,0.00012628653,0.1079869,0.01757189,0.8602276,0.013296224,0.00006646765],"about_ca_topic_score_codex":0.0002117783,"about_ca_topic_score_gemma":0.00052276615,"teacher_disagreement_score":0.0037014103,"about_ca_system_score_codex":0.0014286607,"about_ca_system_score_gemma":0.0009385778,"threshold_uncertainty_score":0.018180728},"labels":[],"label_agreement":null},{"id":"W2094133109","doi":"10.1007/s00145-014-9180-2","title":"Quantum Private Information Retrieval has Linear Communication Complexity","year":2014,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"University of Waterloo; Industry Canada; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Private information retrieval; Communication complexity; Computer science; Quantum; Protocol (science); Theoretical computer science; Sublinear function; Qubit; Analogy; Upper and lower bounds; Oblivious transfer; Quantum information science; Adversary; Quantum information; Verifiable secret sharing; Cryptography; Mathematics; Computer security; Discrete mathematics; Quantum entanglement; Quantum mechanics; Physics","score_opus":0.03282833233878169,"score_gpt":0.2663926676220972,"score_spread":0.2335643352833155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094133109","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.18677598,0.004875203,0.62440974,0.050941363,0.0009765607,0.00070343824,0.0035711892,0.003635677,0.12411091],"genre_scores_gemma":[0.89689386,0.0019298563,0.051988028,0.003435603,0.0022897425,0.0006918783,0.0014143779,0.0006465315,0.04071018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98781407,0.0032213796,0.00048164523,0.0017012105,0.004896683,0.0018850726],"domain_scores_gemma":[0.8918428,0.085014194,0.0030880661,0.014725498,0.0039986908,0.0013308283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00449239,0.0013421451,0.0043061236,0.0021358847,0.003611081,0.009847103,0.0036449218,0.006010198,0.02623758],"category_scores_gemma":[0.040478494,0.0018246033,0.0022221906,0.0046169753,0.006920155,0.02406677,0.0067965593,0.008092777,0.006216159],"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.0009958136,0.00030995652,0.0009398109,0.00044458607,0.000114074974,0.00020916948,0.00029048644,0.031286497,0.0032794212,0.90442187,0.01613402,0.0415743],"study_design_scores_gemma":[0.00018281645,0.00006454115,0.00032075815,0.00003765858,0.000050703875,0.00017362741,0.000050944625,0.107563436,0.0023543395,0.88625103,0.002892258,0.000057903435],"about_ca_topic_score_codex":0.0024262515,"about_ca_topic_score_gemma":0.0025926372,"teacher_disagreement_score":0.02623758,"about_ca_system_score_codex":0.0072613065,"about_ca_system_score_gemma":0.0075413287,"threshold_uncertainty_score":0.08777344},"labels":[],"label_agreement":null},{"id":"W2095378187","doi":"10.1007/s00145-001-0002-y","title":"Secure Communication in Multicast Channels: The Answer to Franklin and Wright's Question","year":2001,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"123 Certification (Canada)","funders":"Defense Advanced Research Projects Agency","keywords":"Multicast; Communication source; Computer science; Computer network; Computation; Channel (broadcasting); Secure multicast; Scheme (mathematics); Wright; Authentication (law); Theoretical computer science; Xcast; Inter-domain; Mathematics; Algorithm; Computer security","score_opus":0.011147825728187974,"score_gpt":0.2749167811058279,"score_spread":0.26376895537763995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095378187","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.06721897,0.017482106,0.19211152,0.5808322,0.0075601027,0.0001006158,0.00056065386,0.00048377106,0.13365017],"genre_scores_gemma":[0.888809,0.012214202,0.03483084,0.025163798,0.012054605,0.00018158868,0.00022387973,0.00025418785,0.026267774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967661,0.0012133324,0.000119379314,0.00045434447,0.0010307862,0.00041606286],"domain_scores_gemma":[0.9807264,0.013480088,0.0007507648,0.0027366122,0.0019008565,0.000405258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005661124,0.0006043729,0.001426317,0.0010427744,0.0034938129,0.0034752025,0.0016342906,0.01143135,0.008709589],"category_scores_gemma":[0.036106262,0.00066254806,0.0007634778,0.0014422622,0.008996131,0.032614153,0.0055688214,0.00802186,0.0024253584],"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.00013429251,0.000022047023,0.000121491874,0.00008108802,0.000014275358,0.00004086038,0.0002442629,0.00081594806,0.00026344202,0.95622087,0.027550537,0.014490991],"study_design_scores_gemma":[0.00003244205,0.00000813593,0.000041738014,0.000024081815,0.000006279709,0.000051359595,0.000079829086,0.0015758502,0.00021837062,0.98446333,0.013486194,0.000012410593],"about_ca_topic_score_codex":0.00087471434,"about_ca_topic_score_gemma":0.00047475583,"teacher_disagreement_score":0.01143135,"about_ca_system_score_codex":0.0018544339,"about_ca_system_score_gemma":0.0017395678,"threshold_uncertainty_score":0.029939294},"labels":[],"label_agreement":null},{"id":"W2120014373","doi":"10.1007/s00145-007-0327-2","title":"On Unconditionally Secure Distributed Oblivious Transfer","year":2007,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Oblivious transfer; Communication source; Computer science; Randomness; Server; Theoretical computer science; Impossibility; Set (abstract data type); Access structure; Secret sharing; Cryptography; Transfer (computing); Infimum and supremum; Upper and lower bounds; Discrete mathematics; Algorithm; Mathematics; Computer network; Parallel computing","score_opus":0.007361256692201161,"score_gpt":0.24629517356618422,"score_spread":0.23893391687398305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120014373","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.06455386,0.001302516,0.8357959,0.0062586507,0.001166435,0.00019906764,0.00039235284,0.0017484913,0.088582784],"genre_scores_gemma":[0.89155746,0.0013004461,0.048200928,0.0014484851,0.00082717807,0.00037405957,0.0004371307,0.0006917401,0.055162523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99693406,0.0006141091,0.00014383584,0.00044019413,0.001155159,0.00071262295],"domain_scores_gemma":[0.99326515,0.004029569,0.00023565003,0.0018308,0.00041901448,0.00021976921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027001167,0.001597129,0.0021187621,0.0017187675,0.002985807,0.0035035815,0.0029353146,0.0028334914,0.012101383],"category_scores_gemma":[0.009258163,0.0011808077,0.0011965225,0.0026245634,0.0067196377,0.014001414,0.012320638,0.0066986894,0.0027382139],"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.00021211863,0.000037413498,0.000101004414,0.000055222004,0.000011612444,0.000074307485,0.00021340117,0.00652276,0.00084418186,0.9769866,0.002924794,0.0120165935],"study_design_scores_gemma":[0.000023345929,0.000017734646,0.00004061174,0.000017997547,0.000011938805,0.00003351835,0.000016220181,0.01781431,0.000758213,0.97874177,0.0025097565,0.000014527868],"about_ca_topic_score_codex":0.00096276455,"about_ca_topic_score_gemma":0.0009112582,"teacher_disagreement_score":0.012101383,"about_ca_system_score_codex":0.003208451,"about_ca_system_score_gemma":0.0019182777,"threshold_uncertainty_score":0.040483177},"labels":[],"label_agreement":null},{"id":"W2585018408","doi":"10.1007/s00145-016-9251-7","title":"Making the Impossible Possible","year":2017,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Impossible differential cryptanalysis; Block cipher; Key schedule; Boomerang attack; Differential cryptanalysis; Computer science; Linear cryptanalysis; Higher-order differential cryptanalysis; Cipher; Differential (mechanical device); Cryptanalysis; Algorithm; Arithmetic; Theoretical computer science; Computer security; Cryptography; Mathematics; Encryption; Engineering","score_opus":0.06722823537149986,"score_gpt":0.3812333853457928,"score_spread":0.31400514997429296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2585018408","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01074923,0.015437246,0.035007734,0.24848126,0.008990381,0.000046752368,0.0002527826,0.00027034478,0.6807642],"genre_scores_gemma":[0.7240244,0.012978249,0.022077193,0.04553365,0.00625096,0.00027213918,0.00027795293,0.0005568506,0.18802856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969434,0.0013696778,0.00009107395,0.0004641368,0.0007335847,0.00039810984],"domain_scores_gemma":[0.99492896,0.002454227,0.0002375798,0.0013565044,0.0006031168,0.00041971516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036804317,0.0007326514,0.0007755779,0.0008352797,0.0058106193,0.0073628384,0.0011775504,0.0049175825,0.02463573],"category_scores_gemma":[0.013828178,0.00048554328,0.0006675304,0.00054513064,0.022140771,0.019828344,0.0058357595,0.012143154,0.0060070883],"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.000015323405,0.000011304224,0.00006825426,0.00002832498,0.000006752327,0.00003512228,0.00025571985,0.00012933285,0.00006053863,0.9744634,0.019872509,0.0050535495],"study_design_scores_gemma":[0.000008934197,0.000007188605,0.000039119997,0.000061146806,0.0000044441163,0.000049208946,0.00021516228,0.00022829934,0.00010494034,0.90905404,0.090219,0.000008575831],"about_ca_topic_score_codex":0.0015397546,"about_ca_topic_score_gemma":0.0016736694,"teacher_disagreement_score":0.02463573,"about_ca_system_score_codex":0.0019781957,"about_ca_system_score_gemma":0.002514063,"threshold_uncertainty_score":0.08241475},"labels":[],"label_agreement":null},{"id":"W3083633640","doi":"10.1007/s00145-021-09384-1","title":"A Cryptographic Analysis of the TLS 1.3 Handshake Protocol","year":2021,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":83,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Bundesministerium für Bildung und Forschung; Technische Universität Darmstadt; Deutsche Forschungsgemeinschaft; National Science Foundation","keywords":"Handshake; Authenticated Key Exchange; Computer science; Key exchange; Transport Layer Security; Cryptographic protocol; Key (lock); Oakley protocol; Session key; Computer security; Ephemeral key; Computer network; Cryptography; Authentication (law); Protocol (science); Session (web analytics); Replay attack; Public-key cryptography; Encryption; Universal composability; Asynchronous communication; World Wide Web","score_opus":0.012290572746116817,"score_gpt":0.31036893833720214,"score_spread":0.2980783655910853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3083633640","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.16512619,0.0007247327,0.7649461,0.0018437449,0.00021333109,0.0005741714,0.00038272166,0.0007675858,0.065421395],"genre_scores_gemma":[0.9397221,0.00048083966,0.048569467,0.00030593076,0.00015769756,0.00025556082,0.0002597074,0.00010731163,0.010141243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978861,0.00040306032,0.00009503024,0.00015600506,0.0011507508,0.0003089404],"domain_scores_gemma":[0.9973207,0.0012634327,0.00037054348,0.00053968903,0.0004442025,0.00006139463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015208168,0.00059035886,0.00043510992,0.0013694904,0.00097489665,0.0015417235,0.00089798175,0.0008945769,0.00466439],"category_scores_gemma":[0.0041854465,0.00031339406,0.0015481396,0.0008064904,0.0024238543,0.0028846285,0.0014148242,0.0019206181,0.0011148396],"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.00014617792,0.00006269874,0.000567197,0.00010670918,0.000032723976,0.0003745834,0.00029833833,0.052284442,0.008299261,0.92429036,0.0016739663,0.011863527],"study_design_scores_gemma":[0.000060651266,0.00020432874,0.00092147075,0.00006966207,0.00007901106,0.00074542424,0.00015525777,0.48622656,0.015200536,0.47601083,0.020255452,0.00007077455],"about_ca_topic_score_codex":0.0010545936,"about_ca_topic_score_gemma":0.00042126616,"teacher_disagreement_score":0.00466439,"about_ca_system_score_codex":0.0016969638,"about_ca_system_score_gemma":0.0018348616,"threshold_uncertainty_score":0.01560396},"labels":[],"label_agreement":null},{"id":"W4401770362","doi":"10.1007/s00145-024-09515-4","title":"Randomness Recoverable Secret Sharing Schemes","year":2024,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Randomness; Cryptographic primitive; Cryptography; Theoretical computer science; Encryption; Computer science; Secret sharing; Access structure; SSS*; Mathematics; Discrete mathematics; Algorithm; Cryptographic protocol; Computer security; Statistics; Artificial intelligence","score_opus":0.010958444194108708,"score_gpt":0.26604172345676796,"score_spread":0.2550832792626593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401770362","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.10248788,0.0021935967,0.8377168,0.0043469393,0.00047285852,0.0005895082,0.0012560484,0.0028146347,0.04812167],"genre_scores_gemma":[0.8767764,0.0008223408,0.091145836,0.0006891579,0.00031703184,0.00032426853,0.0009770783,0.0002261763,0.028721716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9940864,0.0015174398,0.0003270412,0.00080805534,0.0023334573,0.00092757295],"domain_scores_gemma":[0.99208176,0.002735003,0.000662671,0.0037968208,0.0004069664,0.00031684936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033871874,0.0009061931,0.0015168829,0.0010794449,0.001658148,0.0026244097,0.0032269536,0.002604789,0.00958142],"category_scores_gemma":[0.0068768244,0.00079213444,0.001305718,0.0017545101,0.002393806,0.006108692,0.006170898,0.004341401,0.002826181],"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.0013015802,0.00022576457,0.00048497473,0.0003264341,0.0001499331,0.0003663394,0.00047882274,0.03619047,0.019885056,0.87159467,0.007624313,0.061371643],"study_design_scores_gemma":[0.0005974053,0.00039095304,0.00043909065,0.00014319936,0.00016300626,0.00071346725,0.00009939071,0.16635472,0.04181326,0.7655706,0.023534909,0.00017998517],"about_ca_topic_score_codex":0.0002477943,"about_ca_topic_score_gemma":0.00025127086,"teacher_disagreement_score":0.00958142,"about_ca_system_score_codex":0.0018849972,"about_ca_system_score_gemma":0.00195973,"threshold_uncertainty_score":0.032053053},"labels":[],"label_agreement":null}]}