{"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048075017,0.0005215818,0.9489082,0.0013168815,0.000384826,0.00017535282,8.389871e-7,0.00001945928,0.0005978185],"genre_scores_gemma":[0.68624467,0.000028918494,0.31341922,0.00021159394,0.00004955961,0.0000074547797,1.2871847e-7,0.000006729385,0.000031724936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989485,0.00007016583,0.00032755086,0.00017158833,0.00019517523,0.00028702713],"domain_scores_gemma":[0.9984888,0.000477732,0.00033914836,0.00024823673,0.00034006164,0.00010601217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004063792,0.000116328556,0.00029642737,0.00019515524,0.00009475825,0.000062661195,0.000510573,0.000078920355,0.000011701222],"category_scores_gemma":[0.00023840411,0.00008022709,0.000101109385,0.0003168435,0.00012119455,0.00033917095,0.000026647347,0.00018335514,0.0000040498912],"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.00009067771,0.0002855202,0.0059839874,0.000033901437,0.00009251528,0.0001473961,0.00021833369,0.00029204614,0.0024270958,0.98805094,0.0008327024,0.0015448792],"study_design_scores_gemma":[0.0068959817,0.00874105,0.011736414,0.00023785984,0.00015470343,0.01083122,0.00011726829,0.0014099041,0.05968527,0.85704607,0.04245929,0.00068496173],"about_ca_topic_score_codex":0.0000032829066,"about_ca_topic_score_gemma":0.000007731048,"teacher_disagreement_score":0.63816965,"about_ca_system_score_codex":0.000020779833,"about_ca_system_score_gemma":0.00030283435,"threshold_uncertainty_score":0.32715657},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23876306,0.0009987372,0.75668126,0.0025088107,0.00020570845,0.00007977084,0.0000017555283,0.00003295834,0.0007279339],"genre_scores_gemma":[0.9633657,0.00046496934,0.035483815,0.00052584853,0.00013798576,0.000008506316,4.394501e-7,0.0000060811344,0.000006656837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989152,0.00014832914,0.00036043458,0.00019710418,0.0001328844,0.00024603348],"domain_scores_gemma":[0.99856585,0.00048850966,0.0003514057,0.00030546554,0.0001483583,0.00014038802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005218605,0.0001402243,0.0002978221,0.00027782598,0.00015943071,0.00009701234,0.0007307665,0.00010161149,0.000057318703],"category_scores_gemma":[0.00007501095,0.000101983336,0.000117163705,0.0003813437,0.00016232315,0.00031368772,0.00016735237,0.0002652103,0.000008103592],"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.00009902514,0.00017614712,0.019318465,0.000009327375,0.00008066656,0.000054967633,0.0007716298,0.000025151352,0.0017766772,0.8877581,0.00043311444,0.089496754],"study_design_scores_gemma":[0.00055269693,0.0006695686,0.009335397,0.00001587209,0.000019518722,0.0028316805,0.0002412109,0.0003054258,0.0006803899,0.8519635,0.13317814,0.00020657369],"about_ca_topic_score_codex":0.000005214799,"about_ca_topic_score_gemma":0.0000099255585,"teacher_disagreement_score":0.72460264,"about_ca_system_score_codex":0.000015460388,"about_ca_system_score_gemma":0.000052513296,"threshold_uncertainty_score":0.41587597},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61048555,0.0003542304,0.3729003,0.009308256,0.0023201213,0.000070135975,0.0000028302586,0.000067834924,0.004490729],"genre_scores_gemma":[0.7084529,0.00018834222,0.2874211,0.002622132,0.0010969366,0.0000025481634,0.0000018378058,0.000013474087,0.00020077822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855685,0.00010034652,0.00047074963,0.0001983975,0.000352235,0.00032143074],"domain_scores_gemma":[0.9987884,0.00014894531,0.0003570909,0.00035838573,0.00018799896,0.00015917403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000414434,0.00014198339,0.0003470977,0.0002688521,0.00016256572,0.000083378334,0.0012212165,0.00009158616,0.00013686596],"category_scores_gemma":[0.00008370256,0.00011596673,0.00018697705,0.00031798406,0.00027971357,0.00029144346,0.00015119105,0.00041714864,0.00003320772],"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.00009872025,0.000330788,0.009560293,0.000008125099,0.0000889174,0.0005034669,0.00029196843,0.00015063449,0.0006368142,0.9460161,0.015669866,0.02664435],"study_design_scores_gemma":[0.0011820049,0.0013653405,0.094323374,0.000040443043,0.000019109842,0.0046073953,0.000019942408,0.019300705,0.00056616863,0.77437586,0.103937745,0.0002619066],"about_ca_topic_score_codex":0.000008032502,"about_ca_topic_score_gemma":0.000007001829,"teacher_disagreement_score":0.1716402,"about_ca_system_score_codex":0.00004129353,"about_ca_system_score_gemma":0.0000975205,"threshold_uncertainty_score":0.4728986},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.765299,0.00032807392,0.22645545,0.0005593936,0.00054630946,0.00007173997,0.0000031863203,0.000023890685,0.0067129317],"genre_scores_gemma":[0.9815836,0.00003962663,0.01748811,0.00016638593,0.0003757322,0.0000013478627,0.0000012411473,0.000029298768,0.0003146319],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998013,0.00015208148,0.000801457,0.00014848438,0.00046541964,0.00041954216],"domain_scores_gemma":[0.99660033,0.0019653502,0.0004695402,0.0003070033,0.00042479893,0.00023295506],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018622095,0.00015035114,0.00047590717,0.00060424744,0.000112114874,0.000024936908,0.00035673846,0.00018896161,0.001919042],"category_scores_gemma":[0.0007527929,0.000119781296,0.00032480375,0.00042272705,0.00028519973,0.00014519299,0.000056473633,0.0006344664,0.00007470865],"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.001284193,0.0010215008,0.08310667,0.000052008716,0.0020015347,0.0007507353,0.001418127,0.000008405753,0.010726081,0.83410865,0.058801115,0.0067209695],"study_design_scores_gemma":[0.0010521885,0.00020810802,0.012081915,0.000029583187,0.00017895053,0.00042203622,0.000999236,0.0000067841434,0.00058714993,0.97952086,0.0047868458,0.00012634801],"about_ca_topic_score_codex":0.000014330288,"about_ca_topic_score_gemma":0.00009163411,"teacher_disagreement_score":0.21628459,"about_ca_system_score_codex":0.000039518894,"about_ca_system_score_gemma":0.00009823707,"threshold_uncertainty_score":0.99899334},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63758314,0.00024265904,0.36052564,0.0012792079,0.00019563668,0.000048953076,0.000011045641,0.000007754349,0.00010598585],"genre_scores_gemma":[0.993115,0.000013224029,0.006716691,0.0001157756,0.000030924024,0.0000012881476,0.000004896397,0.00000183793,3.6411558e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894905,0.00003991936,0.0004995538,0.000082873274,0.000283608,0.000144974],"domain_scores_gemma":[0.9988286,0.00004081463,0.0005341015,0.00010451212,0.00039971404,0.00009224678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034876508,0.0000814387,0.00020699276,0.00016598323,0.00005889436,0.000024801311,0.00025199994,0.0000702409,0.00001597319],"category_scores_gemma":[0.000084999905,0.00006707339,0.00009207749,0.0002739159,0.0001116615,0.00025367277,0.000057579808,0.00017025715,0.00000367144],"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.000030543113,0.00014745824,0.00022521887,0.000036005207,0.000025087547,0.000010281596,0.00058171246,0.0010957597,0.00041006532,0.99681574,0.00026424468,0.00035790403],"study_design_scores_gemma":[0.009118514,0.0032146582,0.03325018,0.00036161998,0.00006364823,0.004764538,0.00048964296,0.15681098,0.05606895,0.72367954,0.011526634,0.00065111654],"about_ca_topic_score_codex":9.0770067e-7,"about_ca_topic_score_gemma":8.3320236e-7,"teacher_disagreement_score":0.35553187,"about_ca_system_score_codex":0.000031360974,"about_ca_system_score_gemma":0.00016399389,"threshold_uncertainty_score":0.27351734},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1304608,0.0094707785,0.85005546,0.0068155206,0.00065707794,0.00013349314,5.840767e-7,0.000028041299,0.0023782237],"genre_scores_gemma":[0.8926212,0.00047904009,0.106256604,0.0005490644,0.00008107111,0.0000010845945,1.008457e-7,0.0000029358694,0.000008872351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881464,0.00010180159,0.00053680234,0.00012016788,0.00021632915,0.00021024878],"domain_scores_gemma":[0.9987715,0.00014265058,0.0005174169,0.00026436738,0.00021006778,0.00009399952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040361815,0.00010005896,0.00035809682,0.0003087908,0.000037885875,0.000017177552,0.0007478212,0.000065669745,0.000023084573],"category_scores_gemma":[0.000085095766,0.00007733605,0.00021603602,0.0003864318,0.000102019694,0.0002773457,0.000044690023,0.00021710935,0.000004864093],"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.00016685661,0.0013178083,0.0133541785,0.00027955286,0.00034261047,0.0007821125,0.0009056068,0.0004314292,0.011716582,0.7484346,0.026741456,0.19552723],"study_design_scores_gemma":[0.007494398,0.019346526,0.31443,0.0022184672,0.0004314538,0.012993447,0.0003156297,0.0036561145,0.045586973,0.3818406,0.2100942,0.001592188],"about_ca_topic_score_codex":0.0000016208929,"about_ca_topic_score_gemma":0.0000010383892,"teacher_disagreement_score":0.7621604,"about_ca_system_score_codex":0.00001002116,"about_ca_system_score_gemma":0.00009932247,"threshold_uncertainty_score":0.31536725},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5777072,0.00030167276,0.4131311,0.0063157724,0.00046189755,0.00017455652,0.0000391392,0.000038789578,0.0018299234],"genre_scores_gemma":[0.39182988,0.00088125496,0.6051953,0.0011065745,0.0007317042,0.000007181048,0.00003659432,0.000020176722,0.00019134345],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99897087,0.000069025795,0.0004276187,0.00016270902,0.0001551475,0.00021461402],"domain_scores_gemma":[0.9988966,0.00021148006,0.0002267398,0.00046919548,0.0001190077,0.00007698803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046816337,0.00007906026,0.00022095718,0.0001489039,0.00010710755,0.00007020176,0.0013071537,0.000049299393,0.00063031144],"category_scores_gemma":[0.00003601786,0.00006551483,0.000085884276,0.00018362058,0.000056070945,0.00047149358,0.00010107322,0.000098219025,0.000020635583],"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.0003137711,0.00055465376,0.0064788014,0.000046805457,0.00038281368,0.00013753535,0.0026006333,0.00010287646,0.0043039196,0.34496307,0.16621229,0.47390282],"study_design_scores_gemma":[0.003373684,0.0013596864,0.008016561,0.000027910719,0.00010200224,0.0016574006,0.00030873952,0.020347167,0.0006282642,0.15036772,0.81340593,0.00040492768],"about_ca_topic_score_codex":0.000017801314,"about_ca_topic_score_gemma":0.000019556426,"teacher_disagreement_score":0.6471937,"about_ca_system_score_codex":0.0000118250855,"about_ca_system_score_gemma":0.00008582593,"threshold_uncertainty_score":0.6901468},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.520559,0.00016201247,0.47691593,0.0012350826,0.00038412158,0.000055601715,0.0000053848735,0.000005154388,0.00067771086],"genre_scores_gemma":[0.99847484,0.0000068911104,0.0014249634,0.000056458714,0.000032405882,5.765143e-7,8.1183276e-7,0.0000014820922,0.0000015659618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880904,0.000097141354,0.00065954693,0.000050063758,0.00026802084,0.00011619756],"domain_scores_gemma":[0.99829537,0.000057437395,0.0010411307,0.00020861776,0.00037031362,0.000027159993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003811823,0.000062840205,0.00021656227,0.00009623868,0.000037473397,0.000011253712,0.00058434205,0.00006224261,0.000011254994],"category_scores_gemma":[0.000058004858,0.000039822546,0.00019110812,0.00038426425,0.0001435267,0.00028367573,0.000066706016,0.00014976003,8.981477e-7],"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.00002440707,0.00012837947,0.003809607,0.000029607829,0.000016716649,0.0000017381776,0.00033134635,0.0001599391,0.00066438114,0.9903484,0.0037675828,0.0007179076],"study_design_scores_gemma":[0.001887324,0.0009441722,0.110727325,0.000121979356,0.000049521084,0.0006826591,0.00017941977,0.036736716,0.09616155,0.72463197,0.027654985,0.0002223595],"about_ca_topic_score_codex":0.000008690164,"about_ca_topic_score_gemma":0.0000040154887,"teacher_disagreement_score":0.47791582,"about_ca_system_score_codex":0.000013424167,"about_ca_system_score_gemma":0.00009806122,"threshold_uncertainty_score":0.16239163},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46225512,0.00011228079,0.5321272,0.00396833,0.000573827,0.00004176655,0.0000015065899,0.000008826893,0.00091115606],"genre_scores_gemma":[0.99116176,0.00003088917,0.008101443,0.0005877993,0.0001133035,8.931101e-7,1.8904807e-7,0.0000030118022,7.2488615e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881506,0.0003316723,0.00038018386,0.000099772304,0.0002307092,0.00014257453],"domain_scores_gemma":[0.99765974,0.0012643908,0.0004625306,0.0003835689,0.00017491379,0.000054860542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011209596,0.00008126106,0.0002885129,0.00014795757,0.00006681178,0.000031055646,0.0010219911,0.000061524835,0.000026984926],"category_scores_gemma":[0.00044307506,0.000046261543,0.00015194906,0.00023191888,0.00013050355,0.0002144212,0.00006976784,0.00023504722,0.0000075208136],"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.00014161463,0.000096297415,0.0008401479,0.0000073901156,0.000033110828,0.000008458594,0.00034973177,0.000029111585,0.00058069295,0.98351204,0.0029485477,0.011452868],"study_design_scores_gemma":[0.0057853134,0.002460188,0.04061528,0.00015472261,0.00007415371,0.00078745506,0.00020500646,0.003061648,0.044394534,0.8074575,0.09464199,0.00036222578],"about_ca_topic_score_codex":0.0000024074939,"about_ca_topic_score_gemma":0.000004753742,"teacher_disagreement_score":0.52890664,"about_ca_system_score_codex":0.000004669122,"about_ca_system_score_gemma":0.000038408754,"threshold_uncertainty_score":0.18991306},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24448639,0.000514751,0.7533431,0.0008930356,0.0002549235,0.000033126205,8.8027724e-7,0.000010392052,0.00046339014],"genre_scores_gemma":[0.9171864,0.00024611945,0.08234737,0.00019290428,0.000023376952,5.997073e-7,2.845846e-7,0.0000024016506,5.670988e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992491,0.00011399394,0.00026835702,0.00011535387,0.00011805266,0.00013513549],"domain_scores_gemma":[0.9993783,0.00010303814,0.00013579414,0.00020136243,0.000090488466,0.000090987734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003850159,0.0000670814,0.00015829151,0.0001690378,0.000055550605,0.000049560207,0.0003312782,0.000058247482,0.000014209432],"category_scores_gemma":[0.00009912674,0.000056661895,0.000059235856,0.00020719953,0.000070877686,0.00041797408,0.000019392746,0.00015697355,0.0000026317869],"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.000011401656,0.00006037545,0.002736391,0.0000066346647,0.000018010558,0.000020556097,0.0007052248,0.0000021420276,0.001291535,0.9828989,0.0005708127,0.011678029],"study_design_scores_gemma":[0.0020702211,0.0010986422,0.052409716,0.000026197578,0.000046120476,0.0044733193,0.00015526748,0.00023570679,0.0044988897,0.7976079,0.13705635,0.00032167445],"about_ca_topic_score_codex":0.0000014291318,"about_ca_topic_score_gemma":0.0000018096788,"teacher_disagreement_score":0.6727,"about_ca_system_score_codex":0.000008072797,"about_ca_system_score_gemma":0.000054990007,"threshold_uncertainty_score":0.23106049},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69158953,0.0015878838,0.2958617,0.0018662768,0.0024879642,0.00007135939,0.0000037131588,0.000045229557,0.0064863325],"genre_scores_gemma":[0.94347894,0.00046038916,0.055249866,0.00044870353,0.0003437778,0.0000016749716,8.9642003e-7,0.00000604818,0.0000097085385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99885935,0.0001234839,0.00040489266,0.00014956358,0.00022778272,0.00023492952],"domain_scores_gemma":[0.9989977,0.00022756982,0.00020570769,0.00032839042,0.00012654549,0.00011409746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035999744,0.00010567431,0.0003148697,0.00013502696,0.00007962939,0.00005844958,0.00097338133,0.00008450331,0.00044719342],"category_scores_gemma":[0.000044598677,0.000086480286,0.00017319337,0.0002718778,0.00009408937,0.0006478357,0.00004519524,0.00026810542,0.000073637886],"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.003997525,0.00051859923,0.0011445115,0.000029407896,0.00021567065,0.00064643455,0.0018791788,0.0008937623,0.0006744471,0.60688776,0.016746873,0.36636582],"study_design_scores_gemma":[0.032770526,0.0018821168,0.011245521,0.00007166917,0.000085812346,0.0030075856,0.00009409389,0.004618721,0.0018555509,0.13856521,0.80508447,0.00071872125],"about_ca_topic_score_codex":0.000003867465,"about_ca_topic_score_gemma":0.000005682203,"teacher_disagreement_score":0.7883376,"about_ca_system_score_codex":0.00001265636,"about_ca_system_score_gemma":0.00006704759,"threshold_uncertainty_score":0.48964542},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27252713,0.00037205731,0.72195613,0.0038185844,0.0011987828,0.00007228641,8.624017e-7,0.000029039209,0.000025130452],"genre_scores_gemma":[0.62281215,0.00003605937,0.37619475,0.000281853,0.0006431406,9.539475e-7,4.2917287e-7,0.000010813121,0.000019877603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986308,0.000071192524,0.0005337073,0.00018459899,0.00022584786,0.00035383768],"domain_scores_gemma":[0.9987267,0.00035703517,0.0004611078,0.00020927614,0.00006707959,0.0001787899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003632178,0.00014456593,0.00039717794,0.00021276363,0.00023400433,0.00004159931,0.0007855546,0.00008220349,0.000005175806],"category_scores_gemma":[0.000065923414,0.00011690268,0.00020582504,0.00019236837,0.00004742002,0.00016243102,0.000090183974,0.00032552856,0.000002818439],"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.00027985888,0.00045510175,0.0056305234,0.000111085494,0.0005693825,0.0017166149,0.012095768,0.034456104,0.009527862,0.46456748,0.0486235,0.42196673],"study_design_scores_gemma":[0.009394759,0.0058360444,0.009472947,0.00034885408,0.00009703806,0.025160851,0.00020631196,0.68752825,0.015245892,0.113695644,0.13185862,0.0011547862],"about_ca_topic_score_codex":0.0000053014796,"about_ca_topic_score_gemma":9.852379e-7,"teacher_disagreement_score":0.6530722,"about_ca_system_score_codex":0.000042441723,"about_ca_system_score_gemma":0.0002531677,"threshold_uncertainty_score":0.4767153},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24242212,0.00025578053,0.74199,0.008589478,0.004331267,0.00010158447,0.0000024619296,0.00005980094,0.0022475582],"genre_scores_gemma":[0.6272635,0.000017092485,0.37038314,0.0018371019,0.00044409026,0.0000027640976,5.485158e-7,0.00001422412,0.000037528178],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986236,0.00010205097,0.0004265879,0.00019751121,0.00034264225,0.0003075782],"domain_scores_gemma":[0.99851847,0.00029854127,0.00034549576,0.0004190586,0.00024174851,0.00017666342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041693798,0.00015181968,0.0003140027,0.00044956402,0.000099323704,0.00006900588,0.00092721486,0.00017529266,0.000090291855],"category_scores_gemma":[0.000094189294,0.000112497575,0.00024555868,0.00036259656,0.00014798858,0.00022132075,0.000058346828,0.00077626365,0.000052165473],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017565655,0.0015320529,0.004217833,0.00003439028,0.00032232047,0.0018528382,0.0006538568,0.00169792,0.015312964,0.16923413,0.03216134,0.7728047],"study_design_scores_gemma":[0.013691626,0.010693154,0.119344264,0.00020938266,0.00022933149,0.0076927347,0.00017484484,0.11994583,0.0463004,0.099989615,0.5795788,0.0021499984],"about_ca_topic_score_codex":0.0000041356157,"about_ca_topic_score_gemma":0.000012432486,"teacher_disagreement_score":0.7706547,"about_ca_system_score_codex":0.000010947238,"about_ca_system_score_gemma":0.00014188566,"threshold_uncertainty_score":0.4587518},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024156358,0.0002844297,0.97129536,0.0026838465,0.00076992804,0.00048054827,8.4348375e-7,0.000050400216,0.0002782922],"genre_scores_gemma":[0.80469906,0.0000043197733,0.19453675,0.0004603545,0.00019797229,0.00006036369,6.0115354e-7,0.000010324932,0.00003027811],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998289,0.00022060746,0.00055844034,0.00015138148,0.0003249575,0.0004556365],"domain_scores_gemma":[0.9981455,0.0001989015,0.0006880672,0.000414581,0.00031129806,0.00024163081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072700204,0.00014510765,0.0003028434,0.0002286658,0.000082752056,0.00005274665,0.00091975956,0.00011088608,0.0001667914],"category_scores_gemma":[0.00019697935,0.00012358832,0.00013105072,0.0003117245,0.00010720287,0.0010054688,0.00012864647,0.00030979063,0.00010099299],"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.00015112398,0.001403214,0.009943146,0.00007951949,0.00011382582,0.00007421995,0.0045318794,0.00022622409,0.0043312004,0.9508942,0.0015343472,0.026717097],"study_design_scores_gemma":[0.0108750025,0.0028651876,0.055359058,0.00024811903,0.00023590092,0.0033495866,0.00025305306,0.078495905,0.06804086,0.43963042,0.33875513,0.0018917687],"about_ca_topic_score_codex":8.9086546e-7,"about_ca_topic_score_gemma":6.37529e-7,"teacher_disagreement_score":0.7805427,"about_ca_system_score_codex":0.000082808176,"about_ca_system_score_gemma":0.00012423634,"threshold_uncertainty_score":0.50397855},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23220347,0.0006432043,0.7637312,0.0022714394,0.00039117184,0.00007975804,3.0142138e-7,0.000022666682,0.0006568153],"genre_scores_gemma":[0.87220705,0.000019869318,0.12744078,0.0001436968,0.00016291547,0.0000022130987,1.0579156e-7,0.000009285796,0.000014092995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998178,0.00041327282,0.00057044113,0.00025254145,0.0002141446,0.00037159663],"domain_scores_gemma":[0.99875927,0.00036773394,0.00029006935,0.00024018557,0.00005540739,0.0002873459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010579111,0.0001597554,0.00039251268,0.001039327,0.00014561681,0.00018955105,0.00052918226,0.00011872693,0.00004602692],"category_scores_gemma":[0.0001177214,0.00015016596,0.00011609568,0.0010220413,0.000057146583,0.0007394789,0.00010789235,0.0003496525,0.0000085996635],"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.000078107434,0.00033034434,0.017533852,0.000047413872,0.00017737923,0.00013443427,0.008478371,0.003679262,0.0041097933,0.8534512,0.00062545046,0.11135437],"study_design_scores_gemma":[0.010991588,0.006619954,0.032502495,0.0011727576,0.00033545552,0.009932534,0.0039704978,0.20911196,0.0028193584,0.6914378,0.028058618,0.003046979],"about_ca_topic_score_codex":0.00000723654,"about_ca_topic_score_gemma":0.000021043337,"teacher_disagreement_score":0.64000356,"about_ca_system_score_codex":0.00004371021,"about_ca_system_score_gemma":0.000054209748,"threshold_uncertainty_score":0.612359},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11808119,0.00004969697,0.8742082,0.005608833,0.00045228752,0.000060209935,7.5967495e-7,0.000046362737,0.001492467],"genre_scores_gemma":[0.89002836,0.0000527354,0.10830795,0.0015415373,0.00005920236,5.865695e-7,0.000005173027,0.0000031795128,0.0000012771125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99833006,0.00023949186,0.0008584569,0.000058136837,0.0003286912,0.00018519563],"domain_scores_gemma":[0.9977546,0.00015343943,0.001039213,0.00045120303,0.0004950559,0.00010652717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012078276,0.00010494905,0.00025912543,0.00037291195,0.00019223432,0.00015710571,0.0010675653,0.0001012492,0.000031325428],"category_scores_gemma":[0.0002895603,0.00008838117,0.00012762992,0.00039352936,0.0002037012,0.0024413827,0.00013725729,0.00033583256,0.00010029874],"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.000055683264,0.0000341157,0.00035144802,0.000014295448,0.000019592695,6.6165165e-7,0.0009018392,0.0001638137,0.00007973513,0.99184644,0.0023769715,0.0041553983],"study_design_scores_gemma":[0.0019902885,0.0007945057,0.016262038,0.000047605463,0.00001898561,0.0004887921,0.0001208533,0.26506346,0.001522122,0.29120055,0.42221174,0.0002790845],"about_ca_topic_score_codex":0.0000024371031,"about_ca_topic_score_gemma":0.0000011582389,"teacher_disagreement_score":0.77194715,"about_ca_system_score_codex":0.00002644271,"about_ca_system_score_gemma":0.000076582175,"threshold_uncertainty_score":0.36040795},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.604497,0.001465027,0.37483844,0.018603753,0.00033734937,0.00010142774,0.0000011298064,0.0000106412845,0.00014524203],"genre_scores_gemma":[0.96509033,0.0005616482,0.03353094,0.0007351145,0.00007521384,0.0000024143171,7.532449e-7,0.0000026645264,9.227095e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903786,0.00027833253,0.0003019436,0.000108554595,0.00012666317,0.00014664017],"domain_scores_gemma":[0.999118,0.0002169075,0.00015064195,0.0003250244,0.00011725078,0.000072200266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008288032,0.0000742008,0.00016065518,0.0002061442,0.00008523012,0.00006890048,0.0006297768,0.00007419736,0.000012270334],"category_scores_gemma":[0.00010185769,0.00004980657,0.000038098835,0.00036295402,0.00008039202,0.00041673175,0.00013938181,0.0003141037,0.0000044300514],"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.00021833052,0.0003578749,0.029096544,0.000014466762,0.00004075353,0.00014895313,0.012934928,0.0002945873,0.00061171915,0.90553784,0.003229051,0.047514975],"study_design_scores_gemma":[0.003419514,0.0012263079,0.31316698,0.00028321403,0.00004286937,0.004183744,0.0011035597,0.020304596,0.0005059644,0.4335152,0.22171396,0.0005340956],"about_ca_topic_score_codex":0.000035744044,"about_ca_topic_score_gemma":0.00021615527,"teacher_disagreement_score":0.47202262,"about_ca_system_score_codex":0.000013408697,"about_ca_system_score_gemma":0.000022330005,"threshold_uncertainty_score":0.20310532},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18935458,0.00012835138,0.80805737,0.0011894854,0.00063045457,0.00003731683,0.00003276798,0.000022317114,0.0005473551],"genre_scores_gemma":[0.98372936,0.000021852853,0.015117431,0.00095621176,0.0001555962,4.7630743e-7,0.000013575833,0.000004607403,8.669572e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986719,0.00007170985,0.00047219638,0.00015915318,0.00034120367,0.00028386456],"domain_scores_gemma":[0.99880004,0.00041709092,0.00014452105,0.00024628895,0.00022687948,0.00016516536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070046796,0.000121658144,0.00024712764,0.0003091064,0.00008172359,0.000044208122,0.0007069391,0.00012719192,0.00009744496],"category_scores_gemma":[0.00008675046,0.00009934636,0.00018809961,0.00041241114,0.00008820678,0.00037751606,0.000037322934,0.00040791786,0.000017060132],"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.00011828117,0.00020606587,0.000586548,0.0000053201275,0.000047319674,0.0004304017,0.00020587548,0.000036718255,0.00042532475,0.9887594,0.0069757663,0.0022030035],"study_design_scores_gemma":[0.0024049233,0.0017839167,0.060769826,0.000050428538,0.000038006183,0.002696717,0.00006534407,0.00015481145,0.0027266196,0.882361,0.04660703,0.00034139564],"about_ca_topic_score_codex":0.0000017936892,"about_ca_topic_score_gemma":0.000024253308,"teacher_disagreement_score":0.7943748,"about_ca_system_score_codex":0.00003210514,"about_ca_system_score_gemma":0.00009373139,"threshold_uncertainty_score":0.4051227},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3639172,0.00057834253,0.6018905,0.025288751,0.0020585263,0.00009306974,0.0000011574027,0.00001755299,0.0061548604],"genre_scores_gemma":[0.9690967,0.000040478466,0.030306876,0.00039424494,0.00014569765,0.00000108241,6.394051e-8,0.0000028479863,0.000011980674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991615,0.000065639615,0.00031701897,0.000086307984,0.00017886904,0.0001906935],"domain_scores_gemma":[0.9984729,0.00009726543,0.00066328153,0.00056393404,0.00016192002,0.000040679544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065374863,0.00006582752,0.0001497022,0.000111827816,0.0007260392,0.000420838,0.0017758239,0.000037517144,0.00004725208],"category_scores_gemma":[0.00010399848,0.000040226623,0.00011650492,0.000084908774,0.00013499006,0.00059192406,0.0002241675,0.00020001168,0.00000606814],"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.000015673671,0.00005112488,0.024821581,0.000005426617,0.000058579844,0.00009179406,0.0012690147,0.000010274837,0.00043127255,0.93545824,0.0078207925,0.029966198],"study_design_scores_gemma":[0.0017654521,0.0005824276,0.35950083,0.000046220677,0.0000475116,0.0031266764,0.00044345277,0.0028662663,0.0010816046,0.5476255,0.08264728,0.00026677744],"about_ca_topic_score_codex":0.000010988063,"about_ca_topic_score_gemma":0.000026964106,"teacher_disagreement_score":0.60517955,"about_ca_system_score_codex":0.000012847496,"about_ca_system_score_gemma":0.00010129036,"threshold_uncertainty_score":0.558418},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009425473,0.000031467986,0.97466344,0.0019012945,0.00016364195,0.013511199,0.0000016260403,0.000011275746,0.00029061313],"genre_scores_gemma":[0.87578636,0.0000046601976,0.106995285,0.00070438377,0.000071028786,0.016385462,4.1351794e-7,0.000011546121,0.000040856703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998278,0.00030605827,0.0007183248,0.00016680478,0.00036251027,0.00016828156],"domain_scores_gemma":[0.9972086,0.00016716657,0.0011047871,0.0006423688,0.0008116348,0.00006542275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042118813,0.00009426383,0.00042125507,0.00032403076,0.00006803164,0.000034175544,0.0010418143,0.000072059665,0.000106453255],"category_scores_gemma":[0.0003253015,0.000062831714,0.00044536206,0.002500864,0.0001395917,0.0002566118,0.00022831337,0.00024495766,0.0000019393387],"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.00005004078,0.00066603627,0.036137123,0.000078528814,0.0013699264,0.000060616156,0.0013427164,0.0013846309,0.014967933,0.9342083,0.00016793159,0.009566247],"study_design_scores_gemma":[0.0029455395,0.00042707348,0.20766383,0.00012942214,0.0007070976,0.00064366445,0.00010450465,0.008900929,0.08732393,0.6704205,0.020409657,0.00032380354],"about_ca_topic_score_codex":7.045976e-7,"about_ca_topic_score_gemma":0.000012253404,"teacher_disagreement_score":0.86766815,"about_ca_system_score_codex":0.000020392117,"about_ca_system_score_gemma":0.0002709537,"threshold_uncertainty_score":0.2562203},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09090915,0.0055531194,0.8975143,0.0016189988,0.0025283408,0.000042879867,0.00000297024,0.00006561888,0.0017646198],"genre_scores_gemma":[0.9030228,0.00061260926,0.09539661,0.00040568656,0.0005232459,0.0000026197943,0.0000021086391,0.000012154897,0.000022146749],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998948,0.000059368278,0.00038890055,0.00019733324,0.00018948158,0.0002169256],"domain_scores_gemma":[0.9991769,0.00022211613,0.00012953213,0.00027411635,0.000105293424,0.000092010974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007437338,0.00009970012,0.00027424103,0.0003057431,0.000064638625,0.00025397158,0.0008541423,0.000083375,0.0001150671],"category_scores_gemma":[0.00008957412,0.000078672696,0.00018944396,0.0004192481,0.000046711473,0.0011093811,0.0001758208,0.00036901352,0.000024896914],"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.000054914897,0.00004081136,0.0009949356,0.00006141517,0.00010582124,0.00035157663,0.00043556152,0.000019291694,0.0009700456,0.97266656,0.0069128703,0.017386215],"study_design_scores_gemma":[0.0014817354,0.00027226028,0.0006423198,0.0001895521,0.000040169176,0.0027099052,0.000043222662,0.009649499,0.0025439179,0.5885124,0.3936721,0.00024287708],"about_ca_topic_score_codex":0.000003668889,"about_ca_topic_score_gemma":0.0000029943224,"teacher_disagreement_score":0.81211364,"about_ca_system_score_codex":0.000020497055,"about_ca_system_score_gemma":0.00010827242,"threshold_uncertainty_score":0.32081795},"labels":[],"label_agreement":null}]}