uncommit ./content, update plan article and ecom info

Author: zhuangy47

content/issues/2025-11-01 (43-1)/README.md

@@ -23,7 +23,6 @@ horoscope:
       - {One entry per Zodiac sign}
 ```
 - `/events.yaml`: Upcoming events. Format:
-
 ```yaml
 events:
   - name: "Weekly Social Hour"

content/issues/2025-11-01 (43-1)/generate_newspaper.py

@@ -209,7 +209,7 @@ def restore_image(match):
         text = re.sub(r'§§§IMAGEPLACEHOLDER(\d+)§§§', restore_image, text)
 
         # Convert image placeholders - note: captions are handled separately as italic text following the image
-        text = re.sub(r'§§§IMAGE:(.+?)§§§', r'\\begin{center}\\includegraphics[width=0.9\\columnwidth]{./articles/images/\1}\\end{center}', text)
+        text = re.sub(r'§§§IMAGE:(.+?)§§§', r'\\begin{center}\\includegraphics[width=0.82\\columnwidth]{./articles/images/\1}\\end{center}', text)
         text = text.replace('§§§BEGINLIST§§§', '\\begin{itemize}')
         text = text.replace('§§§ENDLIST§§§', '\\end{itemize}')
         text = re.sub(r'§§§ITEM:(.+?)§§§', r'\\item \1', text)

content/issues/2025-11-01 (43-1)/vol43is1/.gitignore

@@ -2,4 +2,4 @@
 *.fdb_latexmk
 *.fls
 *.synctex.gz
-./content/*
+/content/*

content/issues/2025-11-01 (43-1)/vol43is1/articles/sigecom.md

@@ -1,5 +1,5 @@
 title: SIGEcom Updates!
-authors: ['Bhargav Sampathkumaran']
+authors: ['Nate Levkov']
 
 This semester, SIGecom has been diving deep into the intersection of computer science and economics. Each week, we’ve presented on topics ranging from algorithmic trading and optional membership design to game theory in AI, dynamic pricing, and platform economics—exploring how algorithms shape the markets and digital platforms we interact with every day.
 

content/issues/2025-11-01 (43-1)/vol43is1/articles/sigplan.md

@@ -14,3 +14,10 @@ Great strides are already being seen - a library called mathlib for the theorem
 ## Background
 
 The busy beaver function is one which gives deep insights into computability, as the nth busy beaver is the maximum number of steps a machine with n rules can take before halting. This means if you know the nth busy beaver and your program runs for longer than that, that program is guaranteed to run forever. At first glance, this might suggest a workaround to the famously uncomputable halting problem, until one learns that this function too is uncomputable. Uncomputable here means that there cannot exist any algorithm that can take any input and spit out the corresponding output, and it shows up constantly in the theory of computation to remind us of the expressive power and limitations of what computers can and can’t do. Therefore, it is not even a given that we’ll always be able to find the next busy beaver number, and the difficulty certainly explodes to a tremendous degree with each value that has been found. 
+
+With BB(1), there are only two possible simple cases one need look at, whereas with BB(2), there are over 6000. That said, automation can quickly be used to prove its value is 6. With 3 rules, there are millions of possible machines, and billions for 4. At the very least for 2 and 3 rule machines there are few endlessly looping machines - once one arrives at 4 the number spikes to thousands. Still, through meticulous case analysis the 4th busy beaver was eventually identified at 107 - and as a testament to its progressive difficulty, the 5th busy beaver in turn has eluded researchers for the last 40 years. 
+
+The result was finally obtained at 47,176,870. What’s more amazing is that this result, conjectured by professional mathematicians, ultimately was found by an online community who was working to verify their partial results in rocq. That group that had grown to around 20 researchers featured many from non-traditional academic backgrounds outside the mathematical community. The final proof itself was found and formalized in 40,000 lines in rocq by an anonymous discord user named mxdys - whose background very little is known about.
+
+Developments like these show it’s an exciting time for interactive theorem provers. They demonstrate the possibility that anyone, professional or not, might be able to collaborate on theorems as a legitimate possibility in the near future - an exciting possibility!
+

content/issues/2025-11-01 (43-1)/vol43is1/blurb/sigecom.yaml

@@ -2,9 +2,9 @@ status: active
 
 meeting_times:
   - date: monday
-    start_time: 18:00
-    end_time: 19:20
-    location: SC 1104
+    start_time: 19:00
+    end_time: 20:20
+    location: Loomis 139
 
 blurb: |
   SIGecom is ACM’s Special Interest Group in Economics and Computation. At SIGecom, our goal is simple: to get people’s hands dirty with real projects—no experience required. Whether you’re an economist curious about coding or a CS student fascinated by markets, everyone is welcome to join and learn by building.

content/issues/2025-11-01 (43-1)/vol43is1/blurb/sigplan.yaml

@@ -13,4 +13,4 @@ blurb: |
 
   Besides the opportunity for socials and presentations on intriguing and requested topics, anyone is further welcome to give their own presentations. Whether to share a related topic they’re passionate about, or as motivation to encourage self learning and practice communication of said topics.
 
-  Sigplan meets biweekly, with the next meeting on November 12th (will be on the history of programming languages!). We encourage joining our discord to stay up to date with announcements, (lecture and guest speaker days will also be recorded and posted there). If there are any questions, feel free to reach out to one of our two chairs either by email or discord.
+  Sigplan meets biweekly, with the next meeting on December 3rd. We encourage joining our discord to stay up to date with announcements, (lecture and guest speaker days will also be recorded and posted there). If there are any questions, feel free to reach out to one of our two chairs either by email or discord.

content/issues/2025-11-01 (43-1)/vol43is1/config.yaml

@@ -29,21 +29,21 @@ directory_order:
   - mentorship_committee
   - reflections_projections
   - hackillinois
-  - sigpwny
-  - sigchi
   - gamebuilders
+  - glug
+  - icpc
   - sigaida
+  - sigarch
+  - sigchi
+  - sigecom
   - siggraph
-  - icpc
+  - sigma
   - sigmobile
   - sigmusic
-  - glug
   - signll
-  - sigma
-  - sigquantum
-  - sigecom
   - sigplan
   - sigpolicy
-  - sigarch
+  - sigpwny
+  - sigquantum
   - sigrobotics
   - sigtricity