{"id":"W2086523057","doi":"10.1109/ita.2012.6181790","title":"Nearly-optimal associative memories based on distributed constant weight codes","year":2012,"lang":"en","type":"preprint","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Associative property; Computer science; Constant (computer programming); Content-addressable memory; Parallel computing; Bidirectional associative memory; Content-addressable storage; Distributed computing; Mathematics; Programming language; Artificial neural network; Artificial intelligence","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.000415739,0.000243642,0.0004220711,0.0004258436,0.000387785,0.0007005081,0.0009634321,0.0006285387,0.001379002],"category_scores_gemma":[0.002752999,0.0001564626,0.0001796715,0.000501645,0.0008540339,0.001484238,0.0008031237,0.0006352445,0.0002660932],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005643938,"about_ca_system_score_gemma":0.0006163612,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001047255,"about_ca_topic_score_gemma":0.001789644,"domain_scores_codex":[0.9996898,0.00006385474,0.00001594223,0.00006734565,0.0001084984,0.0000546399],"domain_scores_gemma":[0.9989377,0.0003980519,0.0001189416,0.0002568956,0.0002228409,0.00006564418],"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.0005734498,0.000142817,0.001471502,0.0001626855,0.00007491255,0.0002757739,0.000201268,0.2776319,0.05458993,0.5063297,0.00478619,0.15376],"study_design_scores_gemma":[0.00004389837,0.00008721803,0.0001826969,0.00001133272,0.00001476687,0.0001254135,0.00003213745,0.8205882,0.0203426,0.1562928,0.002257531,0.00002144467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3347374,0.0007428574,0.6524525,0.0005271493,0.0001237238,0.00005794919,0.0001419721,0.001111209,0.01010526],"genre_scores_gemma":[0.936052,0.0002606778,0.06012582,0.0001230581,0.00004378413,0.0000461299,0.00009434653,0.00005448504,0.003199754],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001379002,"threshold_uncertainty_score":0.00461328,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02187188342872424,"score_gpt":0.2738545134822867,"score_spread":0.2519826300535624,"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."}}