{"id":"W2061876185","doi":"10.1142/s0129183101001535","title":"THE HAMMING ASSOCIATIVE MEMORY REVISITED","year":2001,"lang":"en","type":"article","venue":"International Journal of Modern Physics C","topic":"Advanced Memory and Neural Computing","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Content-addressable memory; Computer science; Associative property; Bidirectional associative memory; Hamming distance; Hamming code; Theoretical computer science; Parallel computing; Content-addressable storage; Arithmetic; Algorithm; Topology (electrical circuits); Mathematics; Artificial neural network; Artificial intelligence; Pure mathematics; Combinatorics","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":[],"consensus_categories":[],"category_scores_codex":[0.0001654765,0.00007530188,0.00009770072,0.00002463842,0.00007201395,0.00004671012,0.0002901798,0.00001616841,0.000002847584],"category_scores_gemma":[0.00006296372,0.00005675841,0.00009114894,0.00005799518,0.00001635899,0.00024213,0.00002934163,0.0002436472,0.000005400934],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000094497,"about_ca_system_score_gemma":0.00001080517,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":2.27631e-7,"about_ca_topic_score_gemma":4.076012e-7,"domain_scores_codex":[0.9992843,0.00002089799,0.000238195,0.00004720049,0.0002990304,0.0001103254],"domain_scores_gemma":[0.9992824,0.0002091516,0.0001616357,0.00005804038,0.0002572153,0.00003159615],"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.00005873719,0.00002419589,0.0002850375,0.000004237232,0.000276784,0.0001135226,0.0007000996,0.2151734,0.02568683,0.0008373342,0.0006795953,0.7561602],"study_design_scores_gemma":[0.00268811,0.0001506339,0.003634635,0.0005108095,0.0001029024,0.0007556565,0.0005099864,0.6063705,0.1311525,0.225368,0.02795335,0.0008028598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6598595,0.0009891626,0.3317311,0.00047081,0.001832952,0.00005464866,0.000003936188,0.00006329074,0.004994608],"genre_scores_gemma":[0.9980789,0.0002077616,0.0003812713,0.0000805587,0.001103413,4.580981e-7,9.982326e-7,0.00001331053,0.0001332759],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7553573,"threshold_uncertainty_score":0.2314541,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01595730740798628,"score_gpt":0.2629636708225118,"score_spread":0.2470063634145255,"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."}}