[pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

Author: pre-commit-ci[bot]

papers/SHAURYA_AGARWAL_The_Silmaril_Strikes_Again/The Silmaril strikes again v01.md

@@ -511,7 +511,7 @@ Using `?` to mean "any value", the seven useful subject-predicate-object pattern
 - **? P ?:** only the predicate is known.
 - **? ? O:** only the object is known.
 
-So when we think about building a more complex implementation that can respond efficiently to different types of queries - it is plain to see that building additional indexes (one for every '?') would allow us to answer more complicated queries faster.  
+So when we think about building a more complex implementation that can respond efficiently to different types of queries - it is plain to see that building additional indexes (one for every '?') would allow us to answer more complicated queries faster.
 
 The general mechanism that we discover is:
 
@@ -526,8 +526,8 @@ known term
 
 CWM can emit proof information, and `why.py` contains structures used to represent reasons for statements [@cwmWhySource].
 CWM also includes `check.py`, described as a simple proof checker [@cwmCheckSource].
-These source-supported features make CWM a useful historical example of rule execution with inspectable derivations.  
-   
+These source-supported features make CWM a useful historical example of rule execution with inspectable derivations.
+
 **NOTE**: The systems paper reports that later versions added more indexes to cover almost every subject-predicate-object wildcard pattern, trading faster matching for additional indexing cost [@bernersleeReasonerWeb]. Due to the word-limit of the paper (6K words or fewer), we are not providing a literal analysis of the other indices that actually show up in the CWM code or how these compare to RETE. CWM and RETE are not the same but CWM ported some of the efficiencies of RETE engine used in Pychinko into its own source-code [@bernersleeReasonerWeb].
 
 # Reasoning engines and what they do

papers/SHAURYA_AGARWAL_The_Silmaril_Strikes_Again/mybib.bib

@@ -50,14 +50,14 @@ @inproceedings{schick2023toolformer
 	url          = {https://proceedings.neurips.cc/paper_files/paper/2023/hash/d842425e4bf79ba039352da0f658a906-Abstract-Conference.html}
 }
 @misc{sharma2023sycophancy,
-	title         = {Towards Understanding Sycophancy in Language Models},
-	author        = {Sharma, Mrinank and Tong, Meg and Korbak, Tomasz and Duvenaud, David and Askell, Amanda and Bowman, Samuel R. and others},
-	year          = 2023,
-	doi           = {10.48550/arXiv.2310.13548},
-	url           = {https://arxiv.org/abs/2310.13548},
-	eprint        = {2310.13548},
+	title        = {Towards Understanding Sycophancy in Language Models},
+	author       = {Sharma, Mrinank and Tong, Meg and Korbak, Tomasz and Duvenaud, David and Askell, Amanda and Bowman, Samuel R. and others},
+	year         = 2023,
+	doi          = {10.48550/arXiv.2310.13548},
+	url          = {https://arxiv.org/abs/2310.13548},
+	eprint       = {2310.13548},
 	archiveprefix = {arXiv},
-	primaryclass  = {cs.CL}
+	primaryclass = {cs.CL}
 }
 @inproceedings{pan2023logiclm,
 	title        = {Logic-LM: Empowering Large Language Models with Symbolic Solvers for Faithful Logical Reasoning},
@@ -118,14 +118,14 @@ @inproceedings{lyu2023faithfulcot
 	url          = {https://aclanthology.org/2023.ijcnlp-main.20/}
 }
 @misc{lanham2023faithfulness,
-	title         = {Measuring Faithfulness in Chain-of-Thought Reasoning},
-	author        = {Lanham, Tamera and Chen, Anna and Radhakrishnan, Ansh and Steiner, Benoit and Denison, Carson and others},
-	year          = 2023,
-	doi           = {10.48550/arXiv.2307.13702},
-	url           = {https://arxiv.org/abs/2307.13702},
-	eprint        = {2307.13702},
+	title        = {Measuring Faithfulness in Chain-of-Thought Reasoning},
+	author       = {Lanham, Tamera and Chen, Anna and Radhakrishnan, Ansh and Steiner, Benoit and Denison, Carson and others},
+	year         = 2023,
+	doi          = {10.48550/arXiv.2307.13702},
+	url          = {https://arxiv.org/abs/2307.13702},
+	eprint       = {2307.13702},
 	archiveprefix = {arXiv},
-	primaryclass  = {cs.CL}
+	primaryclass = {cs.CL}
 }
 @techreport{w3c2014rdf11,
 	title        = {RDF 1.1 Concepts and Abstract Syntax},

papers/SHAURYA_AGARWAL_The_Silmaril_Strikes_Again/myst.yml

@@ -9,11 +9,11 @@ project:
     systems with deterministic reasoning capabilities'
   description: >-
     This paper examines how ontology and formal reasoning systems can provide
-    explicit state and replayable checks alongside large language models.
-    It uses CWM as a historical case, explains several reasoning methods,
-    proposes a reasoner-mediated propose-check-repair interaction pattern,
-    and discusses columnar, distributed, and GPU execution as possible
-    scaling directions for selected workloads.
+    explicit state and replayable checks alongside large language models. It
+    uses CWM as a historical case, explains several reasoning methods, proposes
+    a reasoner-mediated propose-check-repair interaction pattern, and discusses
+    columnar, distributed, and GPU execution as possible scaling directions for
+    selected workloads.
   authors:
     - name: Shaurya Agarwal
       email: 3shauryashaurya@gmail.com