{"id":"W4409149101","doi":"10.1038/s44335-025-00020-w","title":"Solving Boolean satisfiability problems with resistive content addressable memories","year":2025,"lang":"en","type":"article","venue":"npj Unconventional Computing","topic":"Advanced Memory and Neural Computing","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Air Force Research Laboratory; Defense Sciences Office, DARPA; Advanced Research Projects Agency; Defense Advanced Research Projects Agency","keywords":"Boolean satisfiability problem; Resistive touchscreen; Satisfiability; Computer science; Content (measure theory); Arithmetic; Theoretical computer science; Mathematics; Operating system","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.0003551657,0.0002425021,0.0002893683,0.00009934687,0.0003988779,0.00006800751,0.0001743322,0.00006082442,0.00003850718],"category_scores_gemma":[0.00009301803,0.0002277837,0.00009047597,0.0003396218,0.0001052167,0.0001990365,0.0001086572,0.0003530305,0.000009136362],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000157858,"about_ca_system_score_gemma":0.00005415586,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001346405,"about_ca_topic_score_gemma":0.00005996805,"domain_scores_codex":[0.998542,0.000058774,0.0004145498,0.0003635233,0.0002333763,0.0003878192],"domain_scores_gemma":[0.9991169,0.0003452307,0.00008402502,0.0002134948,0.0001736716,0.00006668361],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001447072,0.0001085485,0.02963192,0.001493163,0.000395106,0.00003515524,0.0004791291,0.8967637,0.02040129,0.03089123,0.001071161,0.01858488],"study_design_scores_gemma":[0.006988448,0.0005556396,0.2259049,0.007219082,0.0003081963,0.0001090953,0.002538913,0.5368636,0.151325,0.05556636,0.009651694,0.002969128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7804781,0.0007276349,0.2007434,0.0001307965,0.0008598465,0.000489791,0.000009405328,0.0008191287,0.01574195],"genre_scores_gemma":[0.9946313,0.000003779584,0.004487886,0.00007370399,0.0001268439,0.00001077724,0.00001886236,0.00002462228,0.0006222606],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3599001,"threshold_uncertainty_score":0.9288749,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02469057822901485,"score_gpt":0.2343322980256038,"score_spread":0.209641719796589,"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."}}