{"id":"W3028759481","doi":"","title":"Faster Explicit Formulas for Computing Pairings over Ordinary Curves.","year":2010,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Exponentiation; Parameterized complexity; Pairing; Elliptic curve; Computer science; Computation; Cryptography; Context (archaeology); Quadratic equation; Arithmetic; Mathematics; Theoretical computer science; Algebra over a field; Algorithm; Pure mathematics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0007297296,0.0007416088,0.001015564,0.0005782248,0.0003901031,0.0001976706,0.002991212,0.0006658053,0.00004306375],"category_scores_gemma":[0.0001725739,0.0007055166,0.0008880939,0.0002565184,0.0003808207,0.0002224086,0.006882777,0.002394804,0.00006106886],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004422164,"about_ca_system_score_gemma":0.0002355159,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007308632,"about_ca_topic_score_gemma":0.00007443238,"domain_scores_codex":[0.9955917,0.0002347643,0.0008611189,0.001818612,0.0003720709,0.00112171],"domain_scores_gemma":[0.9957774,0.001097269,0.0005952917,0.002046427,0.000189599,0.0002940237],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006502072,0.0002464469,0.004437403,0.001080303,0.0003277531,0.00008919362,0.00234605,0.0002953547,0.00104386,0.9578611,0.005182115,0.02702538],"study_design_scores_gemma":[0.00101502,0.0002016012,0.02137522,0.0008234654,0.00009346955,0.0001599311,0.00003566391,0.05859302,0.00082221,0.9039828,0.01179888,0.00109869],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07981449,0.000557685,0.9106674,0.002769072,0.00277096,0.001566078,0.00005558435,0.0004468821,0.0013519],"genre_scores_gemma":[0.1074361,0.0002162138,0.8894999,0.001865448,0.0004573112,0.0003503301,0.00009299726,0.00007329803,0.000008386706],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.05829766,"threshold_uncertainty_score":0.9999067,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01729256799778458,"score_gpt":0.2769583647404634,"score_spread":0.2596657967426789,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}