{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002181688,0.00008672736,0.0000932667,0.00003740613,0.0001156759,0.0001811268,0.0002774771,0.00003959924,0.0001315266],"category_scores_gemma":[0.00002441162,0.00007239413,0.00002715467,0.0002714628,0.00002064926,0.0003352331,0.00004420895,0.00006311387,0.0002051953],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001841388,"about_ca_system_score_gemma":0.00005012306,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002154584,"about_ca_topic_score_gemma":0.000007721418,"domain_scores_codex":[0.9992038,0.00004443207,0.000130837,0.0002370498,0.000154705,0.0002291918],"domain_scores_gemma":[0.999465,0.00002570687,0.00004287603,0.000303347,0.0000862673,0.00007679586],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001593537,0.0007243696,0.002484661,0.0001087354,0.00006962853,0.00007128189,0.001955187,0.02557676,0.0009451447,0.7198427,0.09240588,0.1557997],"study_design_scores_gemma":[0.003000672,0.0003646991,0.0001954035,0.0002293232,0.00003725996,0.0002527508,0.0009654434,0.8344578,0.04940549,0.02787427,0.08166842,0.001548513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001290028,0.0003104048,0.8025826,0.0003662287,0.0003006162,0.00007099337,1.954184e-7,0.0001780462,0.1949009],"genre_scores_gemma":[0.5540424,0.00007536786,0.3597704,0.001669397,0.00007651977,0.00002569501,0.000002977232,0.00001784457,0.08431938],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.808881,"threshold_uncertainty_score":0.2952147,"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."}}