{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00110339,0.0006194235,0.0007232853,0.0002195395,0.0002355325,0.0005137217,0.002119193,0.000554097,0.00009342075],"category_scores_gemma":[0.0004951783,0.0005450403,0.0002867361,0.0003867817,0.0001790912,0.0003133413,0.002005142,0.001358746,0.00007903787],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006680601,"about_ca_system_score_gemma":0.0005405432,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001718836,"about_ca_topic_score_gemma":0.0000421267,"domain_scores_codex":[0.9964453,0.0003967932,0.000531791,0.001033353,0.0008502498,0.0007425133],"domain_scores_gemma":[0.9960837,0.0009972384,0.0005955468,0.001656846,0.0004507334,0.0002158861],"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.0005002436,0.004876944,0.06247022,0.0009363324,0.001852711,0.0005315823,0.01711517,0.008818032,0.001269194,0.5877037,0.2512946,0.06263129],"study_design_scores_gemma":[0.001051745,0.0006087717,0.007522714,0.001127456,0.0001893061,0.00001811064,0.0002220536,0.8498595,0.1079106,0.02115045,0.006584955,0.003754414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002643185,0.00009251321,0.9646357,0.001617799,0.002089031,0.0006182322,0.000260252,0.003394953,0.02464833],"genre_scores_gemma":[0.7047182,0.00001092569,0.2939923,0.0004835944,0.0001803821,0.0001215225,0.0001277847,0.00003650231,0.0003288364],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8410414,"threshold_uncertainty_score":0.9997001,"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."}}