{"id":"W2084272545","doi":"10.1109/sips.2014.6986075","title":"Algorithm and architecture for a multiple-field context-driven search engine using fully-parallel clustered associative memories","year":2014,"lang":"en","type":"preprint","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Content-addressable memory; Content-addressable storage; Parallel computing; Context (archaeology); Search engine; Field (mathematics); Binary search algorithm; Search algorithm; Associative property; Reduction (mathematics); Theoretical computer science; Algorithm; Artificial intelligence; Artificial neural network; Information retrieval; Mathematics","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.0005082178,0.000374503,0.0005474903,0.0001659133,0.000299824,0.0006085015,0.0006762557,0.0004202555,0.000003528029],"category_scores_gemma":[0.000239166,0.0003346819,0.0001268442,0.0001655844,0.00006627713,0.0001754135,0.001159525,0.0006094982,0.000001120011],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008593413,"about_ca_system_score_gemma":0.0002086193,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007919469,"about_ca_topic_score_gemma":0.00008058277,"domain_scores_codex":[0.9978595,0.0001698213,0.0003539154,0.0008368042,0.0003168127,0.0004631326],"domain_scores_gemma":[0.9977921,0.0009320031,0.000263912,0.0004604883,0.0004142706,0.0001372072],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004936876,0.00004336438,0.0002370203,0.0002926919,0.0001739239,0.000003055992,0.004897494,0.4440512,0.00001604105,0.0004672175,0.0006155092,0.5491531],"study_design_scores_gemma":[0.0008777609,0.0001111999,0.00003130664,0.0002092196,0.00003172496,0.000008190759,0.00009143316,0.9931948,0.0002814953,0.004348243,0.0004189125,0.0003957664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001417557,0.0003315905,0.9951825,0.001357012,0.0005493272,0.0007663456,0.0000232887,0.00023364,0.000138778],"genre_scores_gemma":[0.05129691,0.00004025275,0.9470847,0.0005474231,0.0004458959,0.0000605157,0.00005053623,0.00003106131,0.0004427114],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5491436,"threshold_uncertainty_score":0.9999105,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02721648179549626,"score_gpt":0.2813589087105173,"score_spread":0.254142426915021,"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."}}