{"id":"W2105367753","doi":"10.1109/pacrim.1989.48438","title":"MACHAM: a best match content addressable memory","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Hamming distance; Content-addressable memory; Template; Chip; Hamming code; Character (mathematics); Content-addressable storage; Content (measure theory); Computer hardware; Acronym; Very-large-scale integration; Artificial intelligence; Embedded system; Algorithm; Programming language; Artificial neural network; Mathematics; Decoding methods","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.0002722719,0.0004867178,0.0005918102,0.0007787818,0.0004193076,0.001210131,0.002905639,0.000826173,0.02284264],"category_scores_gemma":[0.0008262734,0.0002063318,0.0003324274,0.0006887495,0.0003067989,0.001543966,0.001015857,0.0005786918,0.006236103],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004588906,"about_ca_system_score_gemma":0.0005213102,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004223349,"about_ca_topic_score_gemma":0.000871938,"domain_scores_codex":[0.9996263,0.00004111623,0.00002838233,0.00006557508,0.0001792715,0.00005945145],"domain_scores_gemma":[0.9996281,0.00005960961,0.00004746944,0.0001080117,0.0001217347,0.00003509352],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.001706569,0.0003521621,0.001201008,0.0004628316,0.0001008663,0.0005972898,0.00008243853,0.014625,0.1077058,0.05577662,0.1095669,0.7078225],"study_design_scores_gemma":[0.0005423926,0.002122494,0.001442727,0.0001209338,0.0001658566,0.002459601,0.0001126977,0.3462368,0.2565983,0.04582788,0.3441987,0.0001716135],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07183486,0.00664885,0.8137174,0.001099102,0.001486218,0.0006973956,0.00284413,0.03318584,0.06848624],"genre_scores_gemma":[0.4695356,0.001016668,0.4581701,0.00113775,0.0004157742,0.0005500008,0.00401741,0.0005962391,0.06456051],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02284264,"threshold_uncertainty_score":0.07641625,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05053941562026288,"score_gpt":0.2426788123119602,"score_spread":0.1921393966916973,"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."}}