{"id":"W3030340285","doi":"","title":"A heuristic for finding compatible differential paths with application to HAS-160.","year":2013,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Hash function; Computer science; Heuristic; Differential (mechanical device); Collision; Algorithm; Theoretical computer science; Function (biology); Perfect hash function; Context (archaeology); Hash table; Artificial intelligence; Physics; Programming language","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"],"consensus_categories":[],"category_scores_codex":[0.0002003642,0.0004393816,0.0006002395,0.000496308,0.0004300608,0.0003744547,0.001438533,0.0001711163,0.00006226365],"category_scores_gemma":[0.00004934792,0.0004029535,0.0002023312,0.0002542575,0.0002064368,0.0001039508,0.001856947,0.0005533526,0.00007811139],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006833336,"about_ca_system_score_gemma":0.0002087812,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002909346,"about_ca_topic_score_gemma":0.0005914021,"domain_scores_codex":[0.9971144,0.0001574285,0.0005676952,0.001239719,0.0002768336,0.0006439136],"domain_scores_gemma":[0.9974496,0.0004832815,0.0003763553,0.001249266,0.0002034456,0.0002380941],"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.00005592823,0.0001786138,0.002357414,0.0001302499,0.0001225361,0.000005117887,0.005442671,0.0007275722,0.0006069636,0.9760925,0.001036541,0.01324387],"study_design_scores_gemma":[0.0009353771,0.0003403199,0.02295527,0.00009291217,0.00006671765,0.0000200511,0.0001699706,0.09201224,0.00032373,0.8792791,0.003125521,0.000678819],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1670099,0.00001376162,0.8279848,0.001480536,0.0004220731,0.002581056,0.0001465835,0.0001736066,0.0001877496],"genre_scores_gemma":[0.5069932,0.000005845609,0.4903217,0.0001508704,0.00008507447,0.002203291,0.0002185105,0.00002065471,8.280074e-7],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.3399833,"threshold_uncertainty_score":0.9998422,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03058253597894831,"score_gpt":0.2979124901089871,"score_spread":0.2673299541300387,"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."}}