{"id":"W2561570369","doi":"","title":"Equation Satisfiability and Program Satisfiability for Finite Monoids","year":2000,"lang":"en","type":"article","venue":"","topic":"Hermeneutics and Narrative Identity","field":"Arts and Humanities","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University; Université de Montréal","funders":"","keywords":"Aperiodic graph; Satisfiability; Monoid; Mathematics; Conjecture; Discrete mathematics; Time complexity; Polynomial; Boolean satisfiability problem; Closure (psychology); Complexity class; Combinatorics; Computer science; Algebra over a field; Pure 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002632038,0.0005807852,0.001040071,0.001427917,0.00206493,0.00433034,0.001826567,0.001360024,0.00480294],"category_scores_gemma":[0.01447253,0.0006506401,0.001986268,0.002068497,0.004335611,0.01124865,0.00248889,0.003871445,0.0002426922],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003104243,"about_ca_system_score_gemma":0.002077362,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00427564,"about_ca_topic_score_gemma":0.003838771,"domain_scores_codex":[0.99751,0.0006409899,0.0002017321,0.0007855905,0.0004925856,0.0003692159],"domain_scores_gemma":[0.9739571,0.02249997,0.001397024,0.001226875,0.0004638864,0.0004551612],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004445815,0.0003568192,0.008529497,0.0006912791,0.0001179103,0.0004551297,0.002836917,0.05911473,0.004629892,0.8831807,0.001833931,0.03780871],"study_design_scores_gemma":[0.00008485778,0.00008856025,0.001533716,0.00003894851,0.00004768932,0.0002216494,0.0005655609,0.1192586,0.004445992,0.8706122,0.003059749,0.00004241648],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6770066,0.001183434,0.3018438,0.004342123,0.00006822916,0.0002086445,0.0007706645,0.0003801124,0.0141963],"genre_scores_gemma":[0.893958,0.0006502866,0.1001718,0.0002038164,0.0001666253,0.0001336809,0.0008588132,0.00005941089,0.003797497],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00480294,"threshold_uncertainty_score":0.02252293,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04510365396557586,"score_gpt":0.2771957777420989,"score_spread":0.232092123776523,"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."}}