{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001434016,0.0002006458,0.0001822653,0.0001225705,0.0002825423,0.0002239073,0.002212986,0.0001015749,0.000002766014],"category_scores_gemma":[0.000001306372,0.0002025244,0.000074166,0.0003921009,0.0000756763,0.000853619,0.0002951407,0.0002218741,0.0000532316],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001083859,"about_ca_system_score_gemma":0.00003964571,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007611723,"about_ca_topic_score_gemma":0.000003185833,"domain_scores_codex":[0.998549,0.00001684808,0.0002650012,0.0006996194,0.000130803,0.0003386787],"domain_scores_gemma":[0.9985307,0.00004143976,0.0001015162,0.001128265,0.0001039572,0.00009405806],"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":[8.780344e-7,0.0001947036,0.00001453317,0.000002946659,0.000006636148,6.892191e-7,0.00006737553,0.00001007513,0.01526122,0.03079871,0.003109917,0.9505323],"study_design_scores_gemma":[0.00108592,0.0004640788,0.002983826,0.00001972309,0.00002051273,0.00005920762,0.00007687949,0.1620111,0.08231549,0.1370683,0.6129808,0.000914126],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006372966,0.00007401032,0.9953623,0.001406414,0.00002731807,0.001065676,0.0001138872,0.00124901,0.00006404532],"genre_scores_gemma":[0.01065751,0.000009508843,0.9876004,0.0008605386,0.0001344,0.0005235493,0.0001620327,0.00001109327,0.00004090178],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9496182,"threshold_uncertainty_score":0.8258705,"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."}}