{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001847843,0.0005827222,0.0007667358,0.001119599,0.001274773,0.001066939,0.001290985,0.001141673,0.006947963],"category_scores_gemma":[0.009055349,0.0004725138,0.0006893231,0.001063948,0.001750123,0.001727855,0.003328717,0.001184825,0.001008892],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008620187,"about_ca_system_score_gemma":0.002380108,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008160725,"about_ca_topic_score_gemma":0.001498925,"domain_scores_codex":[0.9983908,0.0004984864,0.00009066952,0.0002675269,0.0005046642,0.0002478867],"domain_scores_gemma":[0.9960088,0.002010091,0.0003391553,0.0008885543,0.0004636835,0.0002898778],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00243129,0.00121875,0.01313806,0.0008199275,0.0001799929,0.002040616,0.002067622,0.1621062,0.04241675,0.2985511,0.01256663,0.4624631],"study_design_scores_gemma":[0.0004314306,0.001383325,0.001547026,0.0001546524,0.0001334908,0.001512516,0.001322614,0.6391617,0.02551168,0.3066249,0.02210853,0.0001081452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2590344,0.0004517444,0.7165661,0.0009232541,0.0001221352,0.0008140245,0.0002417182,0.001252361,0.02059418],"genre_scores_gemma":[0.5680384,0.00008266832,0.4268938,0.0001934507,0.00001850888,0.0001786206,0.0003301452,0.0001707296,0.004093714],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006947963,"threshold_uncertainty_score":0.02324325,"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."}}