{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003372499,0.000384224,0.0004159424,0.0005192606,0.0004840368,0.001067994,0.001020423,0.001001628,0.004829098],"category_scores_gemma":[0.00084918,0.0001744967,0.0002919888,0.0007794306,0.001432748,0.003117905,0.0008852826,0.001135794,0.001188601],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006840862,"about_ca_system_score_gemma":0.0005452498,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001061791,"about_ca_topic_score_gemma":0.0008494006,"domain_scores_codex":[0.9997961,0.00004017626,0.00001495491,0.000048957,0.0000626239,0.00003737946],"domain_scores_gemma":[0.9998098,0.00006844247,0.00001795628,0.00003248948,0.00005472619,0.00001664408],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000376817,0.00001346692,0.0001287918,0.0002561713,0.00001532326,0.0001325784,0.00007634857,0.00272315,0.003125092,0.9317955,0.004762621,0.05693329],"study_design_scores_gemma":[0.00001713586,0.0001181033,0.0003588371,0.0001484153,0.00003313756,0.001035141,0.00009565336,0.01694581,0.007301697,0.748607,0.2252905,0.00004860799],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07807837,0.2617147,0.3668664,0.01284393,0.006522358,0.0001320201,0.0005247969,0.0005664383,0.2727509],"genre_scores_gemma":[0.70031,0.1184389,0.07285903,0.005487004,0.004612809,0.0001858951,0.0002384553,0.0001304381,0.09773751],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004829098,"threshold_uncertainty_score":0.016155,"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."}}