{"id":"W2347294433","doi":"","title":"An Incremental Hash Algorithm for Hard Disk Integrity Check","year":2009,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Hash function; Computer science; Double hashing; Rolling hash; Hash chain; SHA-2; Hash tree; Secure Hash Algorithm; Cryptographic hash function; Collision resistance; Algorithm; Hash table; Function (biology); MDC-2; SWIFFT","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007046494,0.0004350094,0.0006445509,0.001344518,0.0008860615,0.0008603713,0.002026487,0.0005738548,0.003052787],"category_scores_gemma":[0.002521623,0.0003108193,0.0005369551,0.001048128,0.0007333108,0.002820008,0.001710421,0.0009532809,0.001038417],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006182098,"about_ca_system_score_gemma":0.001327361,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001165638,"about_ca_topic_score_gemma":0.0009313107,"domain_scores_codex":[0.9989329,0.0001333885,0.00008499949,0.0001826229,0.0005457148,0.0001203383],"domain_scores_gemma":[0.9982882,0.0003523834,0.0001128136,0.0005852254,0.0005829027,0.00007845643],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001070708,0.0001479058,0.002647494,0.0003501896,0.0001001507,0.0003025931,0.0004249944,0.02795245,0.0652101,0.06872699,0.01067614,0.8223903],"study_design_scores_gemma":[0.0003942084,0.001045566,0.002322328,0.00006445889,0.0002151652,0.001739233,0.0002600224,0.700822,0.160106,0.07674529,0.05604027,0.0002453664],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02287455,0.0007553466,0.9698035,0.0001761273,0.000153835,0.0001816544,0.000191373,0.003494433,0.002369279],"genre_scores_gemma":[0.34305,0.0004056136,0.6504261,0.000175465,0.0001912182,0.0002254876,0.0006593617,0.0001737958,0.004692952],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003052787,"threshold_uncertainty_score":0.01021266,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02078301211109193,"score_gpt":0.2959857010537808,"score_spread":0.2752026889426889,"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."}}