{"paper":{"title":"Al-Ghasali: A Computational Framework for Simulating Islamic Jurisprudential Rulings via Finite State Automata and Large Language Models","arxiv_id":"2611.17235","primary_cat":"cs.AI","submitted_at":"2026-11-12T18:23:56+00:00","version_compiled":"v1"},"notice":"Every quoted sentence is the authors' text from the arXiv listing abstract. Labels and probabilities are the outputs of classifier-1.13.0 on the question bank abstract-p1-20260923, exactly as returned. No sentence in this record was written by a language model.","schema":"pith.compiled-record/v0","status":"compiled","abstract":{"source":"arXiv listing abstract v1","sentences":[{"i":0,"p":1.0,"id":"s0","own":true,"role":"contribution","text":"This paper presents Al Ghasali, a computational framework designed to formalize and simulate Islamic jurisprudential (Fiqh) rulings.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.87,"main_claim_p":0.12,"quantitative":false,"quantitative_p":0.03,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":1.0,"interpretation":0.0}},{"i":1,"p":0.45,"id":"s1","own":true,"role":"result","text":"Building upon recent set theoretic formalizations of al sabr wa al Taqsim that extract minimal operational rules as simple Horn clause logical programs, this work proves that the semantics of closed Fiqh chapters collapse completely to deterministic Finite State Automata (FSA).","hedge":{"p":1.0,"label":"asserted"},"own_p":0.81,"main_claim_p":0.3,"quantitative":false,"quantitative_p":0.1,"role_probabilities":{"gap":0.0,"method":0.03,"result":0.45,"background":0.08,"limitation":0.0,"future_work":0.0,"contribution":0.44,"interpretation":0.0}},{"i":2,"p":0.85,"id":"s2","own":true,"role":"result","text":"We establish a formal computational hierarchy, demonstrating that restricting formalization to finite propositional Horn theories guarantees decidability and constant time (O(1)) verdict extraction after offline compilation.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.91,"main_claim_p":0.2,"quantitative":true,"quantitative_p":0.97,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.85,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.15,"interpretation":0.0}},{"i":3,"p":0.86,"id":"s3","own":true,"role":"result","text":"The framework formally proves that hierarchical compositions of sub-chapter FSAs preserve this O(1) complexity, and that temporal juristic requirements, such as Tartib (order), are deterministically flattened into static ontological states, preserving the memoryless property of the automaton.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.9,"main_claim_p":0.12,"quantitative":true,"quantitative_p":0.94,"role_probabilities":{"gap":0.0,"method":0.01,"result":0.86,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.12,"interpretation":0.01}},{"i":4,"p":0.95,"id":"s4","own":true,"role":"method","text":"To generate human-readable juristic summaries, Al Ghasali incorporates Large Language Models (LLMs) via an architecture where the deterministic FSA strictly controls the probabilistic LLM.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.87,"main_claim_p":0.07,"quantitative":false,"quantitative_p":0.06,"role_probabilities":{"gap":0.0,"method":0.95,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.05,"interpretation":0.0}},{"i":5,"p":0.78,"id":"s5","own":true,"role":"contribution","text":"Crucially, the paper formulates sufficient design safety conditions for this FSA LLM integration, ensuring strict adherence to the epistemological boundaries of Usul al Fiqh.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.89,"main_claim_p":0.07,"quantitative":false,"quantitative_p":0.09,"role_probabilities":{"gap":0.0,"method":0.19,"result":0.02,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.78,"interpretation":0.01}},{"i":6,"p":0.98,"id":"s6","own":true,"role":"method","text":"To neutralize the risk of LLM hallucination, the system employs a Grammar Guided Constrained Decoding mechanism.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.86,"main_claim_p":0.04,"quantitative":false,"quantitative_p":0.05,"role_probabilities":{"gap":0.0,"method":0.98,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.02,"interpretation":0.0}},{"i":7,"p":0.9,"id":"s7","own":true,"role":"method","text":"We formally define the mapping function that dynamically constructs unambiguous right linear grammars from the FSA execution history.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.93,"main_claim_p":0.04,"quantitative":false,"quantitative_p":0.06,"role_probabilities":{"gap":0.0,"method":0.9,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.1,"interpretation":0.0}},{"i":8,"p":0.91,"id":"s8","own":true,"role":"result","text":"The paper mathematically proves that this architecture, augmented by a Bounded Neutral Lexicon and Valence Locking, guarantees the absolute absence of Decisional Hallucination, Juristic Factual Hallucination, and Semantic Inversion reducing the LLM to a pure linguistic transformer of deterministic juristic facts","hedge":{"p":1.0,"label":"asserted"},"own_p":0.89,"main_claim_p":0.31,"quantitative":false,"quantitative_p":0.44,"role_probabilities":{"gap":0.0,"method":0.01,"result":0.91,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.06,"interpretation":0.02}}]},"compiled":{"main_claim":{"p":0.45,"text":"The paper mathematically proves that this architecture, augmented by a Bounded Neutral Lexicon and Valence Locking, guarantees the absolute absence of Decisional Hallucination, Juristic Factual Hallucination, and Semantic Inversion reducing the LLM to a pure linguistic transformer of deterministic juristic facts","location":"abstract s8","hedge_strength":{"p":1.0,"label":"asserted"}},"provenance":{"route":{"via":"TypeSafe API","model":"classifier-1.13.0","endpoint":"https://api.typesafe.ai/v1/systemone","provider":"TypeSafe"},"packing":"one request per paper","requests":1,"input_tokens":7254,"cost_usd_reported":0.0},"compiled_at":"2026-11-14","bank_version":"abstract-p1-20260923","model_version":"classifier-1.13.0","abstract_states":{"claims_first":0.06,"states_limitation":0.14,"human_participants":0.04,"controlled_comparison":0.02,"randomized_assignment":0.01,"states_quantitative_result":0.91,"compares_with_prior_results":0.24,"mentions_code_or_data_availability":0.03},"evidential_basis":{"p":1.0,"value":"proof or derivation","probabilities":{"argument":0.0,"literature":0.0,"proof_or_derivation":1.0,"analysis_of_existing_data":0.0,"observation_or_experiment":0.0,"simulation_or_computation":0.0}},"contribution_type":{"p":0.89,"value":"method or tool","probabilities":{"review":0.0,"method_or_tool":0.89,"empirical_study":0.0,"simulation_study":0.0,"theoretical_result":0.11,"dataset_or_benchmark":0.0,"position_or_commentary":0.0}},"contribution_statement":{"p":0.69,"text":"This paper presents Al Ghasali, a computational framework designed to formalize and simulate Islamic jurisprudential (Fiqh) rulings.","location":"abstract s0"}},"coverage":{"tier":"abstract","levels_run":["P abstract"],"not_examined":["full text","figures and tables","references and citing sentences","relations to other papers"],"sources_read":["arXiv listing abstract v1"],"levels_not_run":["S sections","T body sentences","C citations","R cross-paper relations"],"sentences_examined":9,"sentences_in_abstract":9},"measured_accuracy":{"url":"https://pith.science/accuracy","measured_on":"2026-10-02","method":"two independent model families labelled a fresh random sample blind; the figure is how often the published label matches their consensus","sentence_role_agreement":0.92,"main_claim_agreement":0.908,"typed_citation_agreement":0.933,"typed_citation_agreement_95_interval":[0.917,0.945],"review_comments_accurate":0.758,"review_comments_accurate_95_interval":[0.684,0.82],"review_caught_admitted_error_found_or_related":0.448,"review_comments_judged":{"judged_by":["gpt-5.6-luna","grok-4.7"],"judged_against":"Pith's own text copy of each paper: text extracted from the PDF, the first 90,000 characters","measured_on":"2026-10-04","accurate":113,"decided":149,"sampled_reviews":200,"split_by_lane":false,"by_lane":"https://pith.science/accuracy#by-lane"}}}