{"id":"W218666475","doi":"10.1007/978-3-642-42045-0_24","title":"A Heuristic for Finding Compatible Differential Paths with Application to HAS-160","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"Concordia University","funders":"","keywords":"Hash function; Computer science; Heuristic; Collision; Algorithm; Differential (mechanical device); Theoretical computer science; Artificial intelligence; Programming language; Physics","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.0003017615,0.0003956317,0.0004012003,0.0007858982,0.0004988505,0.0009577597,0.001814691,0.0001280805,0.00003506148],"category_scores_gemma":[0.00002531031,0.0003345887,0.00009259697,0.0006505662,0.0002873249,0.0003393913,0.0005413003,0.0003012703,0.00002662777],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001464675,"about_ca_system_score_gemma":0.0002700117,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007411787,"about_ca_topic_score_gemma":0.0003280489,"domain_scores_codex":[0.9971249,0.0000162528,0.0004202507,0.001224842,0.0006451136,0.000568662],"domain_scores_gemma":[0.9979664,0.0003597813,0.0002295193,0.0009615691,0.0002961969,0.0001865173],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001837742,0.00008386526,0.0001524368,0.0001000383,0.00002296073,0.000008397422,0.002879249,0.008721453,0.0003863848,0.146706,0.000194434,0.8407264],"study_design_scores_gemma":[0.0006836715,0.0006495836,0.0007779821,0.0002539345,0.00001992324,0.00002223981,0.000001012965,0.8435241,0.0005154424,0.1482957,0.004369083,0.0008873164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0009205727,0.00003138083,0.9958993,0.0007115653,0.0005054247,0.001551225,0.0000216524,0.0001056672,0.0002532673],"genre_scores_gemma":[0.5449688,0.000003082848,0.4540738,0.0005213076,0.0001866043,0.0001565526,0.0000244726,0.00002224396,0.00004317644],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8398391,"threshold_uncertainty_score":0.9999106,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02392205261681029,"score_gpt":0.2705649053188203,"score_spread":0.24664285270201,"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."}}